4865 search results - page 1 / 973 » The Complexity of Graph Connectivity |
WG
2007
Springer
13 years 11 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
MFCS
1992
Springer
13 years 9 months ago
1992
Springer
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...
EJC
2010
13 years 5 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
DM
2011
13 years 15 days ago
2011
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
DM
2007
13 years 5 months ago
2007
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...