721 search results - page 56 / 145 » Almost universal graphs |
104
click to vote
PAMI
2007
14 years 11 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
172
click to vote
OA
1989
15 years 4 months ago
1989
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
113
click to vote
SIROCCO
2007
15 years 1 months ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
CCCG
2004
15 years 1 months ago
2004
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum vo...
ICSE
1992
IEEE-ACM
15 years 4 months ago
1992
IEEE-ACM
This paper describes a language-independent program representation--the program dependence graph--and discusses how program dependence graphs, together with operations such as pro...