1986 search results - page 116 / 398 » Path Separability of Graphs |
GG
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
PVLDB
2010
13 years 7 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
BMCBI
2007
13 years 9 months ago
2007
Background: In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular ...
ICCAD
2000
IEEE
14 years 1 months ago
2000
IEEE
This paper describes an algorithm for simultaneous gate sizing and fanout optimization along the timing-critical paths in a circuit. First, a continuous-variable delay model that ...
ALENEX
2004
13 years 10 months ago
2004
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...