871 search results - page 112 / 175 » The vertex-cover polynomial of a graph |
ATMOS
2010
14 years 8 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
JCO
2011
14 years 4 months ago
2011
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
148
click to vote
DCG
2011
14 years 1 months ago
2011
We describe a variant of a method used by modern graphic artists to design what are traditionally called Celtic knots, which are part of a larger family of designs called “mirro...
WADS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
AAAI
2004
14 years 11 months ago
2004
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...