Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Beldiceanu, N.: Global Constraints as Graph Properties on Structured Network of Elementary Constraints of the Same Type. SICS Technical Report T2000/01, (2000).
2. Cormen, T. H., Leiserson, C. E., Rivest R. L.: Introduction to Algorithms. The MIT Press, (1990).
3. Costa, M-C.: Persistency in maximum cardinality bipartite matchings. Operation Research Letters 15, 143–149, (1994).
4. Damaschke, P., Müller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Information Processing Letters 36, 231–236, (1990).
5. Garey, M. R., Johnson, D. S.: Computers and intractability. A guide to the Theory of NP-Completeness. W. H. Freeman and Company, (1979).
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献