384 search results - page 30 / 77 » On s-hamiltonian-connected line graphs |
GD
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...
PKDD
2009
Springer
14 years 3 months ago
2009
Springer
Probabilistic logics have attracted a great deal of attention during the past few years. While logical languages have taken a central position in research on knowledge representati...
ASUNAM
2011
IEEE
12 years 8 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
CCCG
2001
13 years 10 months ago
2001
We show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. ...
GLOBECOM
2008
IEEE
14 years 3 months ago
2008
IEEE
— The multihop spatial reuse Aloha (MSR-Aloha) protocol was recently introduced by Baccelli et al., where each transmitter selects the receiver among its feasible next hops that ...