6740 search results - page 344 / 1348 » An s -Hamiltonian Line Graph Problem |
134
click to vote
GD
2006
Springer
15 years 8 months ago
2006
Springer
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
126
click to vote
CCCG
2007
15 years 5 months ago
2007
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
129
click to vote
AIPS
2006
15 years 5 months ago
2006
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kep...
122
click to vote
IJCAI
2001
15 years 5 months ago
2001
We show that nodes of high degree tend to occur infrequently in random graphs but frequently in a wide variety of graphs associated with real world search problems. We then study ...
157
click to vote
NIPS
2004
15 years 5 months ago
2004
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...