871 search results - page 101 / 175 » The vertex-cover polynomial of a graph |
183
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
220
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
187
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
196
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
187
click to vote
COCOON
2007
Springer
16 years 1 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...