Sciweavers

731 search results - page 43 / 147
» Reductions to Graph Isomorphism
Sort
View
ALGORITHMICA
2008
83views more  ALGORITHMICA 2008»
15 years 1 months ago
Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs
In this paper we consider the p-ary transitive reduction (TRp) problem where p > 0 is an integer; for p = 2 this problem arises in inferring a sparsest possible (biological) sig...
Réka Albert, Bhaskar DasGupta, Riccardo Don...
DAC
2009
ACM
15 years 5 months ago
Reduction techniques for synchronous dataflow graphs
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
Marc Geilen
AGTIVE
2007
Springer
15 years 7 months ago
A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
Gernot Veit Batz, Moritz Kroll, Rubino Geiß
DM
2011
223views Education» more  DM 2011»
14 years 8 months ago
On graph equivalences preserved under extensions
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
Zbigniew Lonc, Miroslaw Truszczynski
ICCD
2006
IEEE
137views Hardware» more  ICCD 2006»
15 years 10 months ago
Reduction of Crosstalk Pessimism using Tendency Graph Approach
— Accurate estimation of worst-case crosstalk effects is critical for a realistic estimation of the worst-case behavior of deep sub-micron circuits. Crosstalk analysis models usu...
Murthy Palla, Klaus Koch, Jens Bargfrede, Manfred ...