6598 search results - page 96 / 1320 » Graph Theory with Applications |
122
click to vote
ISPDC
2008
IEEE
15 years 10 months ago
2008
IEEE
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, ...
140
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
146
click to vote
GD
1995
Springer
15 years 8 months ago
1995
Springer
Abstract. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental la...
132
click to vote
DATE
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract— This paper introduces a transformational design method which can be used to map code written in a high level source language, like C, to a coarse grain reconfigurable ...
118
click to vote
IJCAI
2003
15 years 5 months ago
2003
Graphplan planning graphs are structures widely used in modern planners. The exclusion relations calculated in the planning graph extension provide very useful information, especi...