Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
- 1 March 1985
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 25 (1) , 1-23
- https://doi.org/10.1007/bf01934985
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Concurrent transmissions in broadcast networksPublished by Springer Nature ,1984
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Synthesizing constraint expressionsCommunications of the ACM, 1978
- Reduced State Enumeration?Another Algorithm for Reliability EvaluationIEEE Transactions on Reliability, 1978
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- On simple characterizations of k-treesDiscrete Mathematics, 1974
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Properties and characterizations of k ‐treesMathematika, 1971
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960