3008 search results - page 124 / 602 » Independence in connected graphs |
149
click to vote
APVIS
2009
15 years 7 months ago
2009
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph "multiplecategory graphs". Social networks are typic...
173
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
151
click to vote
ARSCOM
2004
15 years 6 months ago
2004
We show that in any graph G on n vertices with d(x) + d(y) n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian c...
171
click to vote
ACSC
2004
IEEE
15 years 10 months ago
2004
IEEE
Two important recent trends in military and civilian communications have been the increasing tendency to base operations around an internal network, and the increasing threats to ...
184
click to vote
JDA
2010
15 years 4 months ago
2010
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...