Degree-preserving trees

Networks

Volumn 35, Issue 1, 2000, Pages 26-39

  Broersma, Hajo ^a   Koppius, Otto ^a   Tuinstra, Hilde ^a   Huck, Andreas ^b   Kloks, Ton ^c   Kratsch, Dieter ^d   Müller, Haiko ^d  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b LEIBNIZ UNIVERSITY HANNOVER   (Germany)

^c VU UNIVERSITY AMSTERDAM   (Netherlands)

^d FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Algorithms; Approximation; Asteroidal number; AT free graphs; Cocomparability graphs; Complexity; Degree condition; Graphs; Interval graphs; NP completeness; Planar graphs; Spanning tree; Treewidth

Indexed keywords

EID: 0033632898     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M     Document Type: Article

References (30)

1. [1] M. Aaron and M. Lewinter, 0-deficient vertices of spanning trees, NY Acad Sci Graph Theory Notes 27 (1994), 31-32.
2. [2] S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, J Alg 12 (1991), 308-340.
3. [3] B.S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J ACM 41 (1994), 153-180.
4. [4] R. Bhatia, S. Khuller, R. Pless, and Y.J. Sussmann, The full degree spanning tree problem, Proc 10th Annual ACM-SIAM Symp on Discrete Algorithms, SODA '99, to appear.
5. [5] D. Bienstock and C.L. Monma, On the complexity of embedding planar graphs to minimize certain distance measures, Algorithmica 5 (1990), 93-109.
6. [6] T. Bocchi, D. Gagliardi, and M. Lewinter, K-deficient spanning trees, NY Acad Sci Graph Theory Notes 29 (1995), 42-43.
7. [7] H.L. Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J Comput 25 (1996), 1305-1317.
8. [8] K.S. Booth and G.S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J Comput Syst Sci 13 (1976), 335-379.
9. [9] R.B. Borie, G. Parker, and C.A. Tovey, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursive constructed graph families, Algorithmica 7 (1992), 555-581.
10. [10] H.J. Broersma, T. Kloks, D. Kratsch, and H. Müller, Independent sets in asteroidal triple-free graphs, Proc 24th Int Colloq on Automata, Languages and Programming, ICALP'97, Lecture Notes in Computer Science 1256, Springer-Verlag, Berlin, 1997, 760-770.
11. [11] P.M. Camerini, G. Galbiati, and F. Maffioli, Complexity of spanning tree problems: Part I, Eur J Oper Res 5 (1980), 346-352.
12. [12] P.M. Camerini, G. Galbiati, and F. Maffioli, The complexity of weighted multi-constrained spanning tree problems, Colloq Math Soc Janos Bolyai 44 (1984), 53-101.
13. [13] D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J Symb Comput 9 (1990), 251-280.
14. [14] D.G. Corneil, S. Olariu, and L. Stewart. Asteroidal triple-free graphs, SIAM J Discr Math 10 (1997), 399-430.
15. [15] P. Damaschke, Degree-preserving spanning trees and coloring bounded degree graphs, manuscript, 1997.
16. [16] M. Dell'Amico, M. Labbé, and F. Maffioli, Complexity of spanning tree problems with leaf-dependent objectives, Networks 27 (1996), 175-181.
17. [17] B. de Fluiter, Algorithms for graphs of small treewidth, PhD Thesis, Utrecht University, Utrecht. The Netherlands, 1997.
18. [18] M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, New York, 1979.
19. [19] M.C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
20. 1-∈, Acta Math 182 (1999), 105-142.
21. [21] T. Kloks, Treewidth-computations and approximations, LNCS 842, Springer-Verlag, Berlin, 1994.
22. [22] D. Kratsch and L. Stewart, Domination on cocomparability graphs, SIAM J Discr Math 6 (1993), 400-417.
23. [23] J. van Leeuwen, Graph algorithms, Handbook of theoretical computer science, A: Algorithms and complexity, J. van Leeuwen (Editor), Elsevier, Amsterdam, 1990, 527-631.
24. [24] C.G. Lekkerkerker and J. Ch. Boland, Representation of a finite graph by a set of intervals on the real line, Fundam Math 51 (1962), 45-64.
25. [25] M. Lewinter, Interpolation theorem for the number of degree-preserving vertices of spanning trees, IEEE Trans Circ Syst CAS-34 (1987), 205.
26. [26] M. Lewinter and M. Migdail-Smith, Degree-preserving vertices of spanning trees of the hypercube, NY Acad Sci Graph Theory Notes 13 (1987), 26-27.
27. [27] R.M. McConnell and J.P. Spinrad, Linear time transitive orientation, Proc 8th Ann ACM-SIAM Symp on Discrete Algorithms, SODA'97, 19-25.
28. [28] I.W.M. Pothof and J. Schut, Graph-theoretic approach to identifiability in a water distribution network, Memorandum 1283, Faculty of Applied Mathematics, University of Twente, Enschede, The Netherlands, 1995.
29. [29] H. Rahal, A co-tree flows formulation for steady state in water distribution networks, Adv Eng Softw 22 (1995), 169-178.
30. [30] E. Walter, Identifiability of state space models with applications to transformation systems, Springer-Verlag, New York, 1982.