90 search results - page 11 / 18 » Connecting face hitting sets in planar graphs |
73
Voted
WG
2007
Springer
15 years 5 months ago
2007
Springer
For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the correspondi...
111
Voted
DCG
2011
14 years 6 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
110
click to vote
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each ...
JDA
2010
14 years 10 months ago
2010
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...