Search results for "Edge-separator"

Found 9 publication records. Showing 9 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Rohit Khandekar, Satish Rao, Umesh V. Vazirani	Graph partitioning using single commodity flows.	J. ACM	2009	DBLP DOI BibTeX RDF	Edge-separator, single commodity max-flow, sparse cut, spectral method
2	Rohit Khandekar, Satish Rao, Umesh V. Vazirani	Graph partitioning using single commodity flows.	STOC	2006	DBLP DOI BibTeX RDF	edge-separator, single commodity max-flow, sparse cut, spectral method
1	Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi	On partitioning graphs via single commodity flows.	STOC	2008	DBLP DOI BibTeX RDF	edge-separator, single-commodity max-flow, graph partitioning, spectral method, sparsest cut, matrix exponential
1	Young June Pyun, Douglas S. Reeves	Strategic deployment of network monitors for attack attribution.	BROADNETS	2007	DBLP DOI BibTeX RDF
1	M. Cemil Azizoglu, Ömer Egecioglu	Lower Bounds on Communication Loads with Optimal Placements in Torus Networks.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	edge separator, routing, interconnection network, placement, Torus, load, bisection
1	Xiao Zhou, Abul Kashem, Takao Nishizeki	Generalized Edge-Ranking of Trees (Extended Abstract).	WG	1996	DBLP DOI BibTeX RDF	Edge-ranking, Separator tree, Algorithm, Tree
1	Xiao Zhou, Takao Nishizeki	An Efficient Algorithm for Edge-Ranking Trees.	ESA	1994	DBLP DOI BibTeX RDF
1	Ondrej Sýkora, Imrich Vrto	Edge Separators for Graphs of Bounded Genus with Applications.	WG	1991	DBLP DOI BibTeX RDF
1	Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto	Edge Separators for Planar Graphs and Their Applications.	MFCS	1988	DBLP DOI BibTeX RDF

Displaying result #1 - #9 of 9 (100 per page; Change: )