3471 search results - page 85 / 695 » Obstacle Numbers of Graphs |
138
Voted
ORL
2008
15 years 3 months ago
2008
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
140
click to vote
CHI
2010
ACM
15 years 10 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
113
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
124
click to vote
FAW
2009
Springer
15 years 10 months ago
2009
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...
153
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...