✦ LIBER ✦

An NC Algorithm for the Perfect Matching Problem in Larger cycle-free Graphs

✍ Scribed by J. Lakhal; L. Litzler

Book ID: 108498089
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 34 KB
Volume: 3
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80037-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NC algorithms for computing the number o

NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problems

✍ Vijay V. Vazirani 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 768 KB

An NC algorithm for the clique cover pro

An NC algorithm for the clique cover problem in cocomparability graphs and its application

✍ Chongkye Rhee; Y.Daniel Liang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 322 KB

On the parameterized vertex cover proble

On the parameterized vertex cover problem for graphs with perfect matching

✍ Wang, JianXin; Li, WenJun; Li, ShaoHua; Chen, JianEr 📂 Article 📅 2014 🏛 Science in China Press (SCP) 🌐 English ⚖ 264 KB

A polynomial algorithm for the minimum w

A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs

✍ Wen-Lian HSU; George L. Nemhauser 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 688 KB

Discrete Mathematics 3X ( 19X2) 6S-71 North-Holland Publishing Company 65 Let G = (V, E) be a graph with a positive number wt(v) assigned to each L' E V. A weighted clique saver of the vertices of G is a collection of cliques with a non-negative weight yC. assigned to each clique C in the collection

An algorithm for the steiner problem in

An algorithm for the steiner problem in graphs

✍ M. L. Shore; L. R. Foulds; P. B. Gibbons 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 528 KB

An algorithm for the steiner problem in

An algorithm for the steiner problem in graphs

✍ J. E. Beasley 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 579 KB