Sciweavers

488 search results - page 68 / 98
» Automorphic Decompositions of Graphs
Sort
View
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
14 years 8 days 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...
JLP
2006
81views more  JLP 2006»
13 years 7 months ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 6 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
ICIP
2000
IEEE
14 years 9 months ago
Shape Approximation Through Recursive Scalable Layer Generation
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
Gerry Melnikov, Aggelos K. Katsaggelos
ICPR
2004
IEEE
14 years 8 months ago
A System to Detect Houses and Residential Street Networks in Multispectral Satellite Images
ACT Maps are vital tools for most government agencies and consumers. However, their manual generation and updating is tedious and time consuming. As a step toward automatic map gen...
Cem Ünsalan, Kim L. Boyer