2 search results - page 1 / 1 » Distance-Hereditary Embeddings of Circulant Graphs |
ITCC
2003
IEEE
13 years 10 months ago
2003
IEEE
In this paper we present a distance-hereditary decomposition of optimal chordal rings of 2k2 nodes into a set of rings of 2k nodes, where k is the diameter. All the rings belongin...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...