253 search results - page 29 / 51 » Perfection thickness of graphs |
WG
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
FOCS
2000
IEEE
14 years 3 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
CATS
2008
14 years 9 days ago
2008
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S (G), if S is a maxim...
COMBINATORICS
1999
13 years 10 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
SIBGRAPI
2006
IEEE
14 years 4 months ago
2006
IEEE
The single triangle-strip loop generation algorithm on a triangulated two-manifold presented by Gopi and Eppstein [4] is based on the guaranteed existence of a perfect matching in...