376 search results - page 2 / 76 » Completely connected clustered graphs |
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
113
click to vote
WG
2010
Springer
14 years 7 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
81
Voted
FCS
2006
14 years 11 months ago
2006
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
79
Voted
ICCSA
2004
Springer
15 years 2 months ago
2004
Springer
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...