4865 search results - page 193 / 973 » The Complexity of Graph Connectivity |
129
click to vote
ALGORITHMICA
2006
15 years 3 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
128
Voted
TCS
2010
15 years 2 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
144
click to vote
ESA
2005
Springer
15 years 9 months ago
2005
Springer
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
147
Voted
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
157
Voted
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...