Recursive Graphs, Recursive Labelings and Shortest Paths
- 1 May 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (2) , 391-397
- https://doi.org/10.1137/0210028
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Minimum dominating cycles in 2-treesInternational Journal of Parallel Programming, 1979
- Linear algorithms on recursive representations of treesJournal of Computer and System Sciences, 1979
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961
- The Use of Linear Graphs in Gauss EliminationSIAM Review, 1961
- A note on two problems in connexion with graphsNumerische Mathematik, 1959