77 search results - page 3 / 16 » Contractions of Planar Graphs in Polynomial Time |
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
GD
2009
Springer
13 years 10 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
ISAAC
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We define a multivariate polynomial that generalizes in a unified way the twovariable interlace polynomial defined by Arratia, Bollob´as and Sorkin on the one hand, and a one-...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...