Sciweavers

3105 search results - page 103 / 621
» The Path-Packing Structure of Graphs
Sort
View
BMCBI
2010
183views more  BMCBI 2010»
15 years 4 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
122
Voted
MFCS
2009
Springer
15 years 11 months ago
FO Model Checking on Nested Pushdown Trees
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...
Alexander Kartzow
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
15 years 11 months ago
Conservation laws and open systems on higher-dimensional networks
— We discuss a framework for defining physical open systems on higher-dimensional complexes. We start with the formalization of the dynamics of open electrical circuits and the ...
Arjan van der Schaft, Bernhard Maschke
CP
2008
Springer
15 years 6 months ago
Perfect Constraints Are Tractable
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
András Z. Salamon, Peter G. Jeavons
DAM
1999
77views more  DAM 1999»
15 years 4 months ago
Compound Constructions of Broadcast Networks
Compound methods have been shown to be very e ective in the construction of broadcast graphs. Compound methods generate a large broadcast graph by combining multiple copies of a b...
Michael J. Dinneen, Jose A. Ventura, Mark C. Wilso...