Sciweavers

3105 search results - page 420 / 621
» The Path-Packing Structure of Graphs
Sort
View
APPINF
2003
15 years 5 months ago
Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
Gur Saran Adhar
FTCS
1998
84views more  FTCS 1998»
15 years 5 months ago
On the Use of Formal Techniques for Validation
The traditional use of formal methods has been for the veri cation of algorithms or protocols. Given the high cost and limitations in state space coverage provided by conventional...
Neeraj Suri, Purnendu Sinha
GG
2008
Springer
15 years 5 months ago
Resolution-Like Theorem Proving for High-Level Conditions
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
Karl-Heinz Pennemann
ENDM
2010
127views more  ENDM 2010»
15 years 4 months ago
MPQ-trees for orthogonal packing problem
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
Cédric Joncour, Arnaud Pêcher, Petru ...
ECEASST
2008
95views more  ECEASST 2008»
15 years 4 months ago
A Static Layout Algorithm for DiaMeta
Abstract: The diagram editor generator framework DIAMETA utilizes meta-modelbased language specifications and supports free-hand as well as structured editing. In this paper we pre...
Sonja Maier, Mark Minas