871 search results - page 42 / 175 » The vertex-cover polynomial of a graph |
FCT
2007
Springer
15 years 3 months ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
EJC
2010
14 years 9 months ago
2010
We prove that for any fixed r 2, the tree-width of graphs not containing Kr as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of the...
COMGEO
2004
ACM
14 years 9 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
STOC
1995
ACM
15 years 1 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
CPC
2004
14 years 9 months ago
2004
This note presents two results on real zeros of chromatic polynomials. The first result states that if G is a graph containing a q-tree as a spanning subgraph, then the chromatic ...