NDLI logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Journal of Experimental Algorithmics (JEA)
  2. Journal of Experimental Algorithmics (JEA) : Volume 21, 2016
  3. Issue (Special Issue SEA 2014, Regular Papers and Special Issue ALENEX 2013), 2016
  4. Short and Simple Cycle Separators in Planar Graphs
Loading...

Please wait, while we are loading the content...

Journal of Experimental Algorithmics (JEA) : Volume 21, 2016
Issue (Special Issue SEA 2014, Regular Papers and Special Issue ALENEX 2013), 2016
Editorial, SEA 2014 Special Issue
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs
Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth
Evaluation of Labeling Strategies for Rotating Maps
Customizable Contraction Hierarchies
Tree-Based Coarsening and Partitioning of Complex Networks
LCP Array Construction in External Memory
Faster Compressed Suffix Trees for Repetitive Collections
Practical Algorithms for Finding Extremal Sets
An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets
Numerical Algorithm for Pólya Enumeration Theorem
Implementing Efficient All Solutions SAT Solvers
ReHub: Extending Hub Labels for Reverse k-Nearest Neighbor Queries on Large-Scale Networks
Introduction to Special Issue ALENEX 2013
Short and Simple Cycle Separators in Planar Graphs
Inducing Suffix and LCP Arrays in External Memory
Lazy Lempel-Ziv Factorization Algorithms
In Memoriam: David S. Johnson

Similar Documents

...
Engineering planar separator algorithms

Article

...
Partitioning planar graphs with costs and weights

Article

...
Total Coloring of Planar Graphs Without Chordal Short Cycles

Article

...
Finding Separator Cuts in Planar Graphs within Twice the Optimal

Article

...
Cycle Covers of Planar 2-Edge-Connected Graphs

Article

...
Distance Constraints on Short Cycles for 3-Colorability of Planar graphs

Article

...
Total Colorings of Planar Graphs without Small Cycles

Article

...
A parallel algorithm for finding a separator in planar graphs

Article

...
On Planar Perfectly Contractile Graphs

Article

Short and Simple Cycle Separators in Planar Graphs

Content Provider ACM Digital Library
Author Fox-Epstein, Eli Mozes, Shay Phothilimthana, Phitchaya Mangpo Sommer, Christian
Copyright Year 2016
Description Author Affiliation: MIT (Mozes, Shay); Tufts University (Fox-Epstein, Eli); UC Berkeley (Phothilimthana, Phitchaya Mangpo)
Abstract We provide an implementation of an algorithm that, given a triangulated planar graph with $\textit{m}$ edges, returns a simple cycle that is a 3/4-balanced separator consisting of at most $&sqrt;8\textit{m}$ edges. An efficient construction of a short and balanced separator that forms a simple cycle is essential in numerous planar graph algorithms, for example, for computing shortest paths, minimum cuts, or maximum flows. To the best of our knowledge, this is the first implementation of such a cycle separator algorithm with a worst-case guarantee on the cycle length. We evaluate the performance of our algorithm and compare it to the planar separator algorithms recently studied by Holzer et al. [2009]. Out of these algorithms, only the Fundamental Cycle Separator (FCS) produces a simple cycle separator. However, FCS does not provide a worst-case size guarantee. We demonstrate that (1) our algorithm is competitive across all test cases in terms of running time, balance, and cycle length; (2) it provides worst-case guarantees on the cycle length, significantly outperforming FCS on some instances; and (3) it scales to large graphs.
Starting Page 1
Ending Page 24
Page Count 24
File Format PDF
ISSN 10846654
e-ISSN 10846654
DOI 10.1145/2957318
Journal Journal of Experimental Algorithmics (JEA)
Volume Number 21
Language English
Publisher Association for Computing Machinery (ACM)
Publisher Date 2016-09-01
Publisher Place New York
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Design Algorithms Cycle separator Performance Planar graphs
Content Type Text
Resource Type Article
Subject Theoretical Computer Science
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...