Arboricity and Subgraph Listing Algorithms
- 1 February 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (1), 210-223
- https://doi.org/10.1137/0214017
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- An algorithm for finding a large independent set in planar graphsNetworks, 1983
- An approximation algorithm for the hamiltonian walk problem on maximal planar graphsDiscrete Applied Mathematics, 1983
- The clique problem for planar graphsInformation Processing Letters, 1981
- Finding a Minimum Circuit in a GraphSIAM Journal on Computing, 1978
- A New Algorithm for Generating All the Maximal Independent SetsSIAM Journal on Computing, 1977
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning TreesNetworks, 1975
- An Analysis of Some Graph Theoretical Cluster TechniquesJournal of the ACM, 1970
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Edge-Disjoint Spanning Trees of Finite GraphsJournal of the London Mathematical Society, 1961