Partitioning planar graphs with costs and weights

doi:10.1145/1187436.1210588

Partitioning planar graphs with costs and weights

Full Text:

PDF

Buy this Article

Authors:	Lyudmil Aleksandrov	Bulgarian Academy of Sciences, Sofia, Bulgaria
	Hristo Djidjev	Los Alamos National Laboratory, Los Alamos, NM, USA
	Hua Guo	Carleton University, Ottawa, ON, CANADA
	Anil Maheshwari	Carleton University, Ottawa, ON, CANADA

	2007 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 28 · Downloads (cumulative): 660 · Citation Count: 2

Published in:

· Journal

Journal of Experimental Algorithmics (JEA) JEA Homepage archive

Volume 11, 2006
Article No. 1.5
ACM New York, NY, USA
table of contents doi>10.1145/1187436.1210588

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms design graph algorithms graph partitioning algorithms graph separators graph theory implementation performance

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder