9532 search results - page 410 / 1907 » Logic, Graphs, and Algorithms |
216
click to vote
FAW
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
169
click to vote
WADS
2007
Springer
16 years 28 days ago
2007
Springer
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
187
click to vote
COMPGEOM
2003
ACM
16 years 2 days ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
187
click to vote
INFOVIS
2002
IEEE
15 years 11 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
193
click to vote
ICPP
1993
IEEE
15 years 11 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...