Efficient algorithms for graphic matroid intersection and parity
- 23 November 2005
- book chapter
- Published by Springer Nature
- p. 210-220
- https://doi.org/10.1007/bfb0015746
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Efficient algorithms for a family of matroid intersection problemsJournal of Algorithms, 1984
- NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDSJournal of the Operations Research Society of Japan, 1983
- Data structures for on-line updating of minimum spanning treesPublished by Association for Computing Machinery (ACM) ,1983
- A linear-time algorithm for a special case of disjoint set unionPublished by Association for Computing Machinery (ACM) ,1983
- Computing Maximal “Polymatroidal” Network FlowsMathematics of Operations Research, 1982
- Combinatorial TheoryPublished by Springer Nature ,1979
- A data structure for orthogonal range queriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- A constructive graph-theoretic solution of the Shannon switching gameIEEE Transactions on Circuit Theory, 1970