Planar separator theorem

Results: 128



#Item
1The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree V´ıt Jel´ınek1 , Eva Jel´ınkov´a1 , Jan Kratochv´ıl12 , Bernard Lidick´ y1 , Marek Tesaˇr1 , Tom´aˇs 12 Vyskoˇcil

The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree V´ıt Jel´ınek1 , Eva Jel´ınkov´a1 , Jan Kratochv´ıl12 , Bernard Lidick´ y1 , Marek Tesaˇr1 , Tom´aˇs 12 Vyskoˇcil

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:44:54
2Reorder.js: A JavaScript Library to Reorder Tables and Networks Jean-Daniel Fekete To cite this version: Jean-Daniel Fekete. Reorder.js: A JavaScript Library to Reorder Tables and Networks. IEEE

Reorder.js: A JavaScript Library to Reorder Tables and Networks Jean-Daniel Fekete To cite this version: Jean-Daniel Fekete. Reorder.js: A JavaScript Library to Reorder Tables and Networks. IEEE

Add to Reading List

Source URL: hal.inria.fr

Language: English - Date: 2016-06-14 10:44:46
3Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell  Computer Engineering and Networks Laboratory

Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks Laboratory

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:28
4A brief summary of the work of Fan Chung 1. Extremal graph theory • Universal graphs The general problem of interest is: “What is the smallest graph which contains as subgraphs (or induced subgraphs) all members of a

A brief summary of the work of Fan Chung 1. Extremal graph theory • Universal graphs The general problem of interest is: “What is the smallest graph which contains as subgraphs (or induced subgraphs) all members of a

Add to Reading List

Source URL: www.math.ucsd.edu

Language: English - Date: 2000-06-04 20:41:54
5Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p

Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:22
6

PDF Document

Add to Reading List

Source URL: ssdbm2011.ssdbm.org

Language: English - Date: 2011-09-01 19:29:47
7A Linear-Time Algorithm for Network Decomposition Lenore J. Cowen Department of Mathematical Sciences The Johns Hopkins University Baltimore, MD 21218 

A Linear-Time Algorithm for Network Decomposition Lenore J. Cowen Department of Mathematical Sciences The Johns Hopkins University Baltimore, MD 21218 

Add to Reading List

Source URL: www.cs.tufts.edu

Language: English - Date: 2012-10-31 09:54:23
8SPATIAL OVERLAY WITH INEXACT NUMERICAL DATA David Pullar Surveying Engineering Department National Center for Geographical Information and Analysis University of Maine, Orono, Maine, U.S. A.

SPATIAL OVERLAY WITH INEXACT NUMERICAL DATA David Pullar Surveying Engineering Department National Center for Geographical Information and Analysis University of Maine, Orono, Maine, U.S. A.

Add to Reading List

Source URL: mapcontext.com

Language: English - Date: 2008-08-29 21:47:52
9arXiv:1201.0118v1 [math.SP] 30 DecSpectral Analysis of Certain Spherically Homogeneous Graphs Jonathan Breuer∗ and Matthias Keller†

arXiv:1201.0118v1 [math.SP] 30 DecSpectral Analysis of Certain Spherically Homogeneous Graphs Jonathan Breuer∗ and Matthias Keller†

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2012-01-03 21:01:04
10Typical distances in a geometric model for complex networks ∗ Mohammed Amin Abdullah† Michel Bode‡

Typical distances in a geometric model for complex networks ∗ Mohammed Amin Abdullah† Michel Bode‡

Add to Reading List

Source URL: web.mat.bham.ac.uk

Language: English - Date: 2015-06-25 12:56:44