641 search results - page 6 / 129 » On Planar Quasi-Parity Graphs |
Book
A classic book on graph theory.
SODA
2012
ACM
11 years 9 months ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
COCO
2010
Springer
13 years 4 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
RSA
2008
13 years 6 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
ISAAC
2005
Springer
14 years 15 days 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 ...