( en | de | ru )

 

Disambiguation of "Cai, Leizhen"

Author of the publication

copydeleteadd this publication to your clipboard
A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph.

, and . Discret. Appl. Math., 73 (1): 27-34 (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jian Cai

Xuediao Cai

Lijun Cai

Cai Berg

Cuifang Cai

 

Other publications of authors with the same name

Dual Connectedness of Edge-Bicolored Graphs and Beyond., and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 141-152. Springer, (2014)Isomorphic Tree Spanner Problems., and . Algorithmica, 14 (2): 138-153 (1995)Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems., , and . IWPEC, volume 4169 of Lecture Notes in Computer Science, page 239-250. Springer, (2006)Finding Two Edge-Disjoint Paths with Length Constraints., and . CoRR, (2015)NP-Completeness of Minimum Spanner Problems.. Discret. Appl. Math., 48 (2): 187-194 (1994)On Spanning 2-trees in a Graph.. Discret. Appl. Math., 74 (3): 203-216 (1997)Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem, , and . CoRR, (2008)A generalization of line graphs: (X, Y)-intersection graphs., , and . J. Graph Theory, 21 (3): 267-287 (1996)Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem., , and . Algorithmica, 59 (4): 510-520 (2011)Incompressibility of H-Free Edge Modification., and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 84-96. Springer, (2013)