Finding a maximum-genus graph imbedding-Reference-Cited by-同舟云学术

Finding a maximum-genus graph imbedding

Published:1988-06 Issue:3 Volume:35 Page:523-534
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Furst Merrick L.¹,Gross Jonathan L.²,McGeoch Lyle A.¹

Affiliation:

1. Carnegie-Mellon Univ., Pittsburgh, PA

2. Columbia Univ., New York, NY

Abstract

The computational complexity of constructing the imbeddings of a given graph into surfaces of different genus is not well understood. In this paper, topological methods and a reduction to linear matroid parity are used to develop a polynomial-time algorithm to find a maximum-genus cellular imbedding. This seems to be the first imbedding algorithm for which the running time is not exponential in the genus of the imbedding surface.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/44483.44485

Reference26 articles.

1. An algorithm for imbedding cubic graphs in the torus;FILOT;J. Comput. Syst. Sci.,1980

2. An augmenting path algorithm for linear matroid parity

3. Lecture Notes in Computer Science;GABOW H. N.,1985

Cited by 56 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decycling cubic graphs;Discrete Mathematics;2024-08

2. DNAforge: a design tool for nucleic acid wireframe nanostructures;Nucleic Acids Research;2024-05-15

3. A General Design Method for Scaffold-Free DNA Wireframe Nanostructures;Lecture Notes in Computer Science;2024

4. New bounds for the average genus and average number of faces of a simple graph;Discrete Mathematics;2024-01

5. Minimum Cuts in Surface Graphs;SIAM Journal on Computing;2023-02-14