Sciweavers

1736 search results - page 73 / 348
» On antimagic directed graphs
Sort
View
COMPGEOM
2003
ACM
14 years 3 months ago
Planar minimally rigid graphs and pseudo-triangulations
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
Ruth Haas, David Orden, Günter Rote, Francisc...
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
14 years 3 months ago
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...
ESA
2009
Springer
106views Algorithms» more  ESA 2009»
14 years 5 months ago
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
Markus Bläser, Christian Hoffmann
TPHOL
2008
IEEE
14 years 5 months ago
Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
Daniel Wasserrab, Andreas Lochbihler
ER
2007
Springer
101views Database» more  ER 2007»
14 years 4 months ago
Using Attributed Goal Graphs for Software Component Selection: An Application of Goal-Oriented Analysis to Decision Making
During software requirements analysis and design steps, developers and stakeholders have many alternatives of artifacts such as software component selection and should make decisi...
Kazuma Yamamoto, Motoshi Saeki