5473 search results - page 143 / 1095 » On the graph isomorphism problem |
173
click to vote
MFCS
2007
Springer
16 years 1 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
192
Voted
ORL
2008
15 years 7 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...
209
click to vote
FCT
2007
Springer
15 years 8 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
290
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
206
Voted
ALGORITHMICA
2006
15 years 7 months ago
2006
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...