This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. E. Bixby, Matroids and operations research, Advanced Techniques in the Practice of Operations Research (H. Greenburg, F. Murphy, S. Shaw, eds.), North-Holland, New York, 1982, 333–458.
J. L. Bentley, T. Ottmann and P. Widmayer, The complexity of manipulating hierarchically defined sets of rectangles, Advances in Computing Research, 1 (1983), 127–158.
E. W. Dijkstra, A discipline of programming, Prentice Hall, Englewood Cliffs, N.J., 1976.
D. Fernandez-Baca and M. Williams, Augmentation Problems on Hierarchically Defined Graphs, TR#89-8, Dept. of Computer Science, Iowa State Univ., August, 1989. (A preliminary version appeared in the Proceedings of WADS 89 (F. Dehne, J.-R. Sack, N. Santoro, eds.), Springer LNCS No. 382 (1989), 563–576.)
H. N. Gabow, Z. Galil, T. Spencer, and R. E. Tarjan, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs, Combinatorica, 6(2) (1986), 109–122.
H. N. Gabow and R. E. Tarjan, A linear-time algorithm for finding a minimum spanning pseudoforest, Information Processing Letters, 27(5) (1988), 259–263.
H. Galperin and A. Widgerson, Succinct representations of graphs, Information and Control, 56 (1983), 183–198.
K. Iwano and K. Steiglitz, Testing for Cycles in Infinite Graphs with Periodic Structure, Proceedings of 19th ACM STOC, 1987, 46–55.
E. L. Lawler, Combinatorial optimization: networks and matroids, Holt, Rinehart and Winston, New York, 1976.
T. Lengauer, Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs, J. Algorithms, 8 (1987), 260–284.
T. Lengauer and K. Wagner, The correlation between the complexities of the non-hierarchical and hierarchical versions of graph properties, Proceedings of STACS 87 (F.J. Brandenburg et al. eds.), Springer LNCS No. 247 (1987), 100–113.
T. Lengauer and E. Wanke, Efficient solution of connectivity problems on hierarchically defined graphs, SIAM Journal on Computing, 17 (1989), 1063–1080.
T. Lengauer and E. Wanke, Efficient analysis of graph properties on context-free graph languages, Proceedings of ICALP 88 (T. Lepistö and A. Salomaa, eds.), Springer LNCS No. 317 (1988), 379–393.
L. R. Matthews, Bicircular Matroids, Quart. J. Math. Oxford (2), 28 (1977), 213–228.
L. R. Matthews, Infinite subgraphs as matroid circuits, Journal of Combinatorial Theory, Series B, 27 (1979), 260–273.
J. B. Orlin, Some problems on dynamic/periodic graphs, Progress in Combinatorial Optimization, Academic Press Canada, Toronto, 1984.
C. H. Papadimitriou and K. Steiglitz, Combinatorial optimization — algorithms and complexity, Prentice Hall, Englewood Cliffs, N.J., 1982.
C. Papadimitriou and M. Yannakakis, A note on succinct representation of graphs, Information and Control, 71 (1986), 181–185.
J. M. S. Simões Pereira, On subgraphs as matroid cells, Math. Z., 127 (1972), 315–322.
R. E. Tarjan, Depth-first search and linear graph algorithms, SIAM Journal on Computing, 1 (1972), 146–160.
K. W. Wagner, The complexity of combinatorial problems with succinct input representation, Acta Informatica, 23 (1986), 325–356.
D. J. A. Welsh, Matroid Theory, London Math. Soc. Monographs, Vol. 8, Academic Press, New York/London, 1976.
N. L. White and W. Whiteley, A class of matroids defined on graphs and hypergraphs by counting properties, Manuscript.
R. J. Wilson, Introduction to Graph Theory, Academic Press, New York, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernández-Baca, D., Williams, M.A. (1990). On matroids and hierarchical graphs. In: Gilbert, J.R., Karlsson, R. (eds) SWAT 90. SWAT 1990. Lecture Notes in Computer Science, vol 447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52846-6_101
Download citation
DOI: https://doi.org/10.1007/3-540-52846-6_101
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52846-3
Online ISBN: 978-3-540-47164-6
eBook Packages: Springer Book Archive