6740 search results - page 202 / 1348 » An s -Hamiltonian Line Graph Problem |
118
Voted
APVIS
2011
14 years 19 days ago
2011
We present the results of a study comparing five directed-edge representations for use in 2D, screen-based node-link diagrams. The goal of this work is to extend the understandin...
117
click to vote
LICS
2003
IEEE
15 years 6 months ago
2003
IEEE
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
119
Voted
SODA
2001
ACM
15 years 2 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
101
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
89
Voted
CAE
2007
15 years 3 months ago
2007
We present a stipple placement method which provides extra emphasis to image features, especially edges. Our algorithm transforms an image into a regular graph, with edge weights ...