3268 search results - page 108 / 654 » The hub number of a graph |
141
click to vote
DM
2000
15 years 6 months ago
2000
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.
163
click to vote
ALGORITHMICA
2006
15 years 6 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...
156
click to vote
MFCS
2009
Springer
16 years 28 days ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
174
click to vote
MKM
2009
Springer
16 years 28 days ago
2009
Springer
Graphical languages provide a powerful tool for describing the behaviour of quantum systems. While the use of graphs vastly reduces the complexity of many calculations [4,10], manu...
149
click to vote
COCOON
2007
Springer
16 years 17 days ago
2007
Springer
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...