|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 27 occurrences of 19 keywords
|
|
|
|
|
Results
Found 18 publication records. Showing 18 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis |
A Unified Geometric Approach to Graph Separators  |
FOCS  |
1991 |
DBLP DOI BibTeX RDF |
randomized NC algorithms, geometric embedding, randomized linear time algorithms, k-overlap graphs, k-nearest neighbor graphs, separator bound, finite element methods, planar graphs, graph separators |
| 1 | Sanjeev Arora, Satish Rao, Umesh V. Vazirani |
Expander flows, geometric embeddings and graph partitioning.  |
J. ACM  |
2009 |
DBLP DOI BibTeX RDF |
Graph partitioning, semidefinite programs, multicommodity flows, expanders, expansion, graph separators |
| 1 | Young June Pyun, Douglas S. Reeves |
Strategic deployment of network monitors for attack attribution.  |
BROADNETS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Flindt Muller, Martin Zachariasen |
Fast and Compact Oracles for Approximate Distances in Planar Graphs.  |
ESA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Fürer, Shiva Prasad Kasiviswanathan |
Spanners for Geometric Intersection Graphs.  |
WADS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama |
Fixed-Parameter Tractability for Non-Crossing Spanning Trees.  |
WADS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn |
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms.  |
WG  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Knauer, Andreas Spillner |
A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators.  |
WG  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | David Steurer |
Tight bounds for the Min-Max boundary decomposition cost of weighted graphs.  |
SPAA  |
2006 |
DBLP DOI BibTeX RDF |
scheduling, load balancing, parallel computing, graph partitioning, graph separators |
| 1 | Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari |
Partitioning planar graphs with costs and weights.  |
ACM Journal of Experimental Algorithmics  |
2006 |
DBLP DOI BibTeX RDF |
graph partitioning algorithms, implementation, Graph algorithms, graph separators |
| 1 | Jonathan A. Kelner |
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus.  |
STOC  |
2004 |
DBLP DOI BibTeX RDF |
bounded genus, circle packing, partitioning, laplacian, graph separators, spectral partitioning |
| 1 | Jochen Alber, Henning Fernau, Rolf Niedermeier |
Graph separators: a parameterized view.  |
J. Comput. Syst. Sci.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnold L. Rosenberg, Lenwood S. Heath |
Graph separators with applications.  |
|
2001 |
RDF |
|
| 1 | Jochen Alber, Henning Fernau, Rolf Niedermeier |
Graph Separators: A Parameterized View.  |
COCOON  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Keith D. Gremban, Gary L. Miller, Shang-Hua Teng |
Moments of Inertia and Graph Separators.  |
J. Comb. Optim.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Hristo Djidjev |
Weighted Graph Separators and Their Applications.  |
ESA  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis |
Separators for sphere-packings and nearest neighbor graphs.  |
J. ACM  |
1997 |
DBLP DOI BibTeX RDF |
centerpoint, rndomized algorithm, sphere-preserving mapping, computational geometry, partitioning, graph algorithms, probabilistic method, point location, graph separators |
| 1 | Keith D. Gremban, Gary L. Miller, Shang-Hua Teng |
Moments of Inertia and Graph Separators.  |
SODA  |
1994 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #18 of 18 (100 per page; Change: )
|
|