article

On linear time minor tests with depth-first search

Author:

Hans L. BodlaenderAuthors Info & Claims

Journal of Algorithms, Volume 14, Issue 1

Pages 1 - 23

https://doi.org/10.1006/jagm.1993.1001

Published: 01 January 1993 Publication History

Abstract

No abstract available.

Cited By

View all

Fomin FGolovach PSagunov DSimonov K(2024)Approximating Long Cycle Above Dirac’s GuaranteeAlgorithmica10.1007/s00453-024-01240-586:8(2676-2713)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1007/s00453-024-01240-5
Fomin FGolovach PLochet WSagunov DSaurabh SSimonov K(2023)Detours in directed graphsJournal of Computer and System Sciences10.1016/j.jcss.2023.05.001137:C(66-86)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.1016/j.jcss.2023.05.001
Lewis RCorcoran PGagarin A(2023)Methods for determining cycles of a specific length in undirected graphs with edge weightsJournal of Combinatorial Optimization10.1007/s10878-023-01091-w46:5Online publication date: 19-Nov-2023
https://dl.acm.org/doi/10.1007/s10878-023-01091-w
Show More Cited By

Index Terms

On linear time minor tests with depth-first search
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Depth-first vs. best-first search: new results
AAAI'93: Proceedings of the eleventh national conference on Artificial intelligence

Best-first search (BFS) expands the fewest nodes among all admissible algorithms using the same cost function, but typically requires exponential space. Depth-first search needs space only linear in the maximum search depth, but expands more nodes than ...
Depth-first vs best-first search
AAAI'91: Proceedings of the ninth National conference on Artificial intelligence - Volume 1

We present a comparison of three well known heuristic search algorithms: best-first search (BFS), iterative-deepening (ID), and depth-first branch-and-bound (DFBB). We develop a model to analyze the time and space complexity of these three algorithms in ...
On External-Memory Planar Depth First Search
WADS '01: Proceedings of the 7th International Workshop on Algorithms and Data Structures

Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algorithms are known for depth-first search or breadth-first search in sparse ...

Comments

Information & Contributors

Information

Published In

Journal of Algorithms Volume 14, Issue 1

Jan. 1993

168 pages

ISSN:0196-6774

Editors:
Zvi Galil
Columbia Univ., New York, NY
,
David S. Johnson
AT&T Bell Labs., Murray Hill, NJ
,
Donald E. Knuth
Stanford Univ., Stanford, CA

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 January 1993

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

48
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Fomin FGolovach PSagunov DSimonov K(2024)Approximating Long Cycle Above Dirac’s GuaranteeAlgorithmica10.1007/s00453-024-01240-586:8(2676-2713)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1007/s00453-024-01240-5
Fomin FGolovach PLochet WSagunov DSaurabh SSimonov K(2023)Detours in directed graphsJournal of Computer and System Sciences10.1016/j.jcss.2023.05.001137:C(66-86)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.1016/j.jcss.2023.05.001
Lewis RCorcoran PGagarin A(2023)Methods for determining cycles of a specific length in undirected graphs with edge weightsJournal of Combinatorial Optimization10.1007/s10878-023-01091-w46:5Online publication date: 19-Nov-2023
https://dl.acm.org/doi/10.1007/s10878-023-01091-w
Sam EFellows MRosamond FGolovach P(2023)On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of LeavesAlgorithms and Complexity10.1007/978-3-031-30448-4_25(353-367)Online publication date: 13-Jun-2023
https://dl.acm.org/doi/10.1007/978-3-031-30448-4_25
Björklund AHusfeldt TKaski PLeonardi SGupta A(2022)The shortest even cycle problem is tractableProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520030(117-130)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3520030
Guo PJiang Y(2022)An improved ant-based heuristic approach for solving the longest cycle problem in large-scale complex networksThe Journal of Supercomputing10.1007/s11227-022-04409-378:12(14164-14190)Online publication date: 1-Aug-2022
https://dl.acm.org/doi/10.1007/s11227-022-04409-3
Chen JCzerwiński WDisser YFeldmann AHermelin DNadara WPilipczuk MPilipczuk MSorge MWróblewski BZych-Pawlewicz AMarx D(2021)Efficient fully dynamic elimination forests with applications to detecting long paths and cyclesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458114(796-809)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458114
Fomin FGolovach PLokshtanov DPanolan FSaurabh SZehavi M(2021)Multiplicative Parameterization Above a GuaranteeACM Transactions on Computation Theory10.1145/346095613:3(1-16)Online publication date: 23-Dec-2021
https://dl.acm.org/doi/10.1145/3460956
Cai LYe J(2019)Two edge-disjoint paths with length constraintsTheoretical Computer Science10.1016/j.tcs.2019.07.009795:C(275-284)Online publication date: 26-Nov-2019
https://dl.acm.org/doi/10.1016/j.tcs.2019.07.009
Tsur D(2019)Faster deterministic parameterized algorithm for k -Path Theoretical Computer Science10.1016/j.tcs.2019.04.024790:C(96-104)Online publication date: 22-Oct-2019
https://dl.acm.org/doi/10.1016/j.tcs.2019.04.024
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Depth-first vs. best-first search: new results

Depth-first vs best-first search

On External-Memory Planar Depth First Search

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations