Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
11 years 5 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...
SIAMDM
2010
194views more  SIAMDM 2010»
11 years 8 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
CORR
2010
Springer
159views Education» more  CORR 2010»
11 years 11 months ago
Counting Plane Graphs: Flippability and its Applications
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csab...
SSPR
2010
Springer
11 years 11 months ago
Extracting Plane Graphs from Images
Abstract. In order to use structural techniques from graph-based pattern recognition, a first necessary step consists in extracting a graph in an automatic way from an image. We pr...
Émilie Samuel, Colin de la Higuera, Jean-Ch...
ESA
2010
Springer
188views Algorithms» more  ESA 2010»
11 years 11 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
11 years 11 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
JGT
2007
87views more  JGT 2007»
12 years 1 months ago
A new upper bound on the cyclic chromatic number
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...
Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, ...
DAM
2007
82views more  DAM 2007»
12 years 1 months ago
Every toroidal graph without adjacent triangles is (4, 1)*-choosable
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...
Baogang Xu, Haihui Zhang
CCCG
2010
12 years 3 months ago
Minimum-area drawings of plane 3-trees
d Abstract) Debajyoti Mondal , Rahnuma Islam Nishat , Md. Saidur Rahman , and Muhammad Jawaherul Alam
Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur...
ISAAC
2005
Springer
135views Algorithms» more  ISAAC 2005»
12 years 7 months ago
Embedding Point Sets into Plane Graphs of Small Dilation
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the ci...
Annette Ebbers-Baumann, Ansgar Grüne, Marek K...
books