1172 search results - page 60 / 235 » Path Algorithms on Regular Graphs |
121
click to vote
JGAA
2007
15 years 9 days ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
111
Voted
FOCS
1994
IEEE
15 years 4 months ago
1994
IEEE
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
128
click to vote
COMGEO
1999
ACM
15 years 2 days ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
151
Voted
DCG
2010
15 years 15 days ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
84
Voted
ASPLOS
2006
ACM
15 years 6 months ago
2006
ACM
Growing on-chip wire delays are motivating architectural features that expose on-chip communication to the compiler. EDGE architectures are one example of communication-exposed mi...