3267 search results - page 35 / 654 » Generalized quasirandom graphs |
PLDI
2004
ACM
14 years 25 days ago
2004
ACM
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...
FCT
1993
Springer
13 years 11 months ago
1993
Springer
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
AMAI
2005
Springer
13 years 7 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
ISDA
2009
IEEE
14 years 2 months ago
2009
IEEE
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
TAMC
2009
Springer
13 years 12 months ago
2009
Springer
Because of irreversibility of movements, motion planning on directed graphs is much more intricate than that on graphs. Recently we showed that the feasibility of motion planning o...