Polynomial algorithms for projection and matching
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 239-251
- https://doi.org/10.1007/3-540-57454-9_19
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Conceptual graphs for semantics and knowledge processingIBM Journal of Research and Development, 1986
- Backtrack search algorithms and the maximal common subgraph problemSoftware: Practice and Experience, 1982
- An Analysis of a Good Algorithm for the Subtree ProblemSIAM Journal on Computing, 1977
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973