8 search results - page 2 / 2 » On the Small Cycle Transversal of Planar Graphs |
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
ESA
1999
Springer
13 years 9 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...