3105 search results - page 241 / 621 » The Path-Packing Structure of Graphs |
105
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The error-prone process of formal specification and verification of large systems requires an efficient, evolutionary formal development approach. Development graphs have...
134
click to vote
ARSCOM
2007
15 years 4 months ago
2007
Let G be a simple graph and f : V (G) → {1, 3, 5, ...} an odd integer valued function defined on V (G). A spanning subgraph F of G is called a (1, f)odd factor if dF (v) ∈ {1...
134
click to vote
ENTCS
2008
15 years 4 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
146
Voted
JDA
2006
15 years 4 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
125
click to vote
JUCS
2007
15 years 3 months ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...