NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs-Reference-Cited by-同舟云学术

NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs

Published:2019-06-17 Issue: Volume: Page:
ISSN:
Container-title:The 31st ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Eppstein David¹,Vazirani Vijay V.¹

Affiliation:

1. University of California, Irvine, Irvine, CA, USA

Funder

National Science Foundation

Publisher

ACM

Link

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

Reference39 articles.

1. Nima Anari and Vijay V. Vazirani. 2019. Matching is as easy as the decision problem in the NC model. Electronic preprint arxiv:1901.10387. Nima Anari and Vijay V. Vazirani. 2019. Matching is as easy as the decision problem in the NC model. Electronic preprint arxiv:1901.10387.

2. Takao Asano. 1985. An approach to the subgraph homeomorphism problem. Theoretical Computer Science38 2--3 (1985) 249--267. Takao Asano. 1985. An approach to the subgraph homeomorphism problem. Theoretical Computer Science38 2--3 (1985) 249--267.

3. Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time.SIAM J;Borradaile Glencora;Comput.,2017

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

1. Killing a Vortex;Journal of the ACM;2024-08

2. Killing a vortex;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

3. Channels, Billiards, and Perfect Matching 2-Divisibility;The Electronic Journal of Combinatorics;2021-06-18

4. Fractionally log-concave and sector-stable polynomials: counting planar matchings and more;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15