8 search results - page 1 / 2 » Planarity Allowing Few Error Vertices in Linear Time |
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
CORR
2012
Springer
12 years 19 days ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
STOC
1990
ACM
13 years 9 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
DFG
2009
Springer
13 years 11 months ago
2009
Springer
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...