9532 search results - page 394 / 1907 » Logic, Graphs, and Algorithms |
163
click to vote
DAC
1998
ACM
16 years 7 months ago
1998
ACM
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
181
click to vote
ESOP
2010
Springer
16 years 4 months ago
2010
Springer
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...
174
click to vote
ISAAC
2005
Springer
16 years 9 days ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
178
click to vote
SWAT
1994
Springer
15 years 11 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
273
Voted
DIAGRAMS
2008
Springer
15 years 8 months ago
2008
Springer
Research on effective algorithms for efficient graph layout continues apace, and faster technology has led to increasing research on algorithms for the depiction of dynamic graphs ...