ENDM 2008 - PDF Preprint Papers

ENDM 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ENDM-2008 Paper

click to vote

ENDM
2008

142views more ENDM 2008»

Augmenting the Connectivity of Planar and Geometric Graphs

13 years 4 months ago

Download i11www.iti.uni-karlsruhe.de

In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...

Ignaz Rutter, Alexander Wolff

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	142	Augmenting the Connectivity of Planar and Geometric Graphs	claim
2	127	Compatible Geometric Matchings	claim
3	123	Morphing Planar Graph Drawings with Bent Edges	claim
4	120	Connectivity check in 3-connected planar graphs with obstacles	claim
5	118	Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs	claim
6	118	Number of Crossing-Free Geometric Graphs vs. Triangulations	claim
7	114	Strong oriented chromatic number of planar graphs without cycles of specific lengths	claim
8	101	A central approach to bound the number of crossings in a generalized configuration	claim
9	94	List Colouring Constants of Triangle Free Graphs	claim
10	93	The Generalized Max-Controlled Set Problem	claim
11	93	On Universal Graphs of Minor Closed Families	claim
12	90	On cliques of Helly Circular-arc Graphs	claim
13	88	Stars and Bonds in Crossing-Critical Graphs	claim
14	88	Bandwidth, treewidth, separators, expansion, and universality	claim
15	87	Computing Canonical Polygonal Schemata with Generalized Maps	claim
16	85	Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem	claim
17	85	Structural Properties of Sparse Graphs	claim
18	82	Repetition-free longest common subsequence	claim
19	82	Finding Folkman Numbers via MAX CUT Problem	claim
20	81	The maximum number of halving lines and the rectilinear crossing number of Kn for n	claim
21	80	Polytopal complexes: maps, chain complexes and... necklaces	claim
22	75	Baxter permutations and plane bipolar orientations	claim
23	65	Characterizing Simultaneous Embedding with Fixed Edges	claim
24	62	Nowhere-zero 5-flows and (1, 2)-factors	claim
25	62	... : The Way of the Bow	claim
26	61	Partial Characterizations of Circular-Arc Graphs	claim
27	61	Diameter and Curvature: Intriguing Analogies	claim
28	61	A bijection for covered maps on orientable surfaces	claim
29	59	Unexpected behaviour of crossing sequences	claim
30	57	Six-Critical Graphs on the Klein Bottle	claim
31	53	A robust P2P streaming architecture and its application to a high quality live-video service	claim
32	51	A Polynomial Bound for Untangling Geometric Planar Graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers