Sciweavers

KIVS
2011
Springer
12 years 8 months ago
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
Hannes Frey, Ranjith Pillay
ESA
2010
Springer
188views Algorithms» more  ESA 2010»
13 years 3 months ago
Contractions of Planar Graphs in Polynomial Time
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
Marcin Kaminski, Daniël Paulusma, Dimitrios M...
COCOA
2010
Springer
13 years 3 months ago
Listing Triconnected Rooted Plane Graphs
A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has a designated outer vertex. For given positive integers ...
Bingbing Zhuang, Hiroshi Nagamochi
GC
2010
Springer
13 years 3 months ago
20 Years of Negami's Planar Cover Conjecture
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
Petr Hlinený
CORR
1999
Springer
145views Education» more  CORR 1999»
13 years 4 months ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein
JGAA
2002
86views more  JGAA 2002»
13 years 4 months ago
Planar Graphs with Topological Constraints
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
Christoph Dornheim
CORR
2002
Springer
115views Education» more  CORR 2002»
13 years 4 months ago
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the ...
Cesim Erten, Stephen G. Kobourov
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
13 years 4 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
COMGEO
2004
ACM
13 years 4 months ago
How to draw the minimum cuts of a planar graph
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
Ulrik Brandes, Sabine Cornelsen, Christian Fie&szl...
COMBINATORICS
2004
100views more  COMBINATORICS 2004»
13 years 4 months ago
Lattice Structures from Planar Graphs
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
Stefan Felsner