Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IPL
2010
111views more  IPL 2010»
11 years 3 months ago
Connecting face hitting sets in planar graphs
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
Pascal Schweitzer, Patrick Schweitzer
CORR
2004
Springer
75views Education» more  CORR 2004»
11 years 5 months ago
Locally connected spanning trees on graphs
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v V (G). The pur...
Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen
JDA
2006
98views more  JDA 2006»
11 years 5 months ago
Completely connected clustered graphs
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
Sabine Cornelsen, Dorothea Wagner
IPL
2008
68views more  IPL 2008»
11 years 5 months ago
The hub number of a graph
A hub set in a graph G is a set U V (G) such that any two vertices outside U are connected by a path whose internal vertices lie in U. We prove that h(G) hc(G) c(G) h(G) + 1, ...
Tracy Grauman, Stephen G. Hartke, Adam Jobson, Bil...
CPAIOR
2010
Springer
11 years 10 months ago
Solving Connected Subgraph Problems in Wildlife Conservation
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
Bistra N. Dilkina, Carla P. Gomes
books