Sciweavers

1383 search results - page 144 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
COCOON
1999
Springer
15 years 10 months ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades
EPIA
1993
Springer
15 years 10 months ago
Resolution of Constraints in Algebras of Rational Trees
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
Luís Damas, Nelma Moreira, Sabine Broda
CNSR
2007
IEEE
336views Communications» more  CNSR 2007»
15 years 10 months ago
Energy Efficient Data Routing in Wireless Sensor Network: A Mixed Approach
This paper presents a data routing protocol for a non-mobile, locationaware wireless sensor network that is primarily designed for continuous monitoring application (e.g. environm...
Md. Ashiqur Rahman, Sajid Hussain
CSR
2006
Springer
15 years 10 months ago
Unfolding Synthesis of Asynchronous Automata
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
Nicolas Baudru, Rémi Morin
DGCI
2006
Springer
15 years 10 months ago
Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
Isabelle Sivignon, David Coeurjolly