Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree

Conferences in Research and Practice in Information Technology Series

Volumn 77, Issue , 2008, Pages

  Asahiro, Yuichi ^a   Miyano, Eiji ^b,d   Ono, Hirotaka ^c  

^a KYUSHU SANGYO UNIVERSITY   (Japan)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

^c KYUSHU UNIVERSITY   (Japan)

^d University of Washington   (United States)

Author keywords

(Outer)planar; (P 4 )bipartite; Cactus; Diamond free; Graph orientation; House free; Min max optimization; NP hardness; Series parallel

Indexed keywords

(OUTER)PLANAR; (P 4-)BIPARTITE; CACTUS; DIAMOND-FREE; GRAPH ORIENTATIONS; HOUSE-FREE; MIN-MAX OPTIMIZATION; NP-HARDNESS; SERIES-PARALLEL;

COMPUTATIONAL COMPLEXITY; HARDNESS; SCHEDULING ALGORITHMS;

TREES (MATHEMATICS);

EID: 84863591626     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Asahiro, Y., Jansson, J., Miyano, E., Ono, H., & Zenmyo, K. (2007), Approximation algorithms for the graph orientation minimizing the maximum Weighted outdegree in 'Proc. 3rd International Conference on Algorithmic Aspects in Information and Management, Lecture Notes in Computer Science', Vol. 4508, pp. 167-177.
2. Asahiro, Y., Miyano, E., Ono, H., & Zenmyo, K. (2007), 'Graph orientation algorithms to minimize the maximum outdegree', International Journal of Foundations of Computer Science, 18(2), pp. 197- 215.
3. Borie, R., Parker, R., & Tovey, C. (2002), 'Solving problems on recursively constructed graphs', Technical Report TR-2002-04, Dept. Comp. Sci., University of Alabama.
4. Brandsẗadt, A., BangLe, V., & Spinrad, J. P. (1987), Graph Classes: A Survey, SIAM.
5. Brodal, G. S., & Fagerberg, R. (1999), Dynamic representations of sparse graphs, in 'Proc. 6th Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science', Vol. 1663, pp. 342- 351.
6. Chv́atal, V. (1975), 'A combinatorial theorem in plane geometry', J. Combinatorial Theory, series B, 18, pp. 39-41.
7. Gairing, M., L̈ucking, T., Mavronicolas, M., & Monien, B. (2004), Computing Nash equilibria for scheduling on restricted parallel links, in Proc. 36th ACM Symposium on Theory of Computing, pp. 613-622.
8. Garey, M., & Johnson, D. (1979), Computers and Intractability: A Guide to the Theory of NPCompleteness, W.H. Freeman and Co., 1979.
9. Gold, E. M. (1978), Complexity of automaton identification from given data, Information and Control, 37(3), pp. 302-320.
10. Gross, J. L., & Yellen, J.(eds) (2004), Handbook of Graph Theory, CRC Press.
11. Ho'ang, C.T., & Le, V.B. 'P4-free colorings and P4-bipartite graphs', Discrete Mathematics and Theoretical Computer Science, 4, pp. 109-122.
12. Hopcroft, J.E., & Tarjan, R.E. (1974), 'Efficient planarity testing', J. ACM, 21, pp. 549-568.
13. Kowalik, L. (2006), Approximation scheme for lowest outdegree orientation and graph density measures, in 'Proc. 17th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science', Vol.4288, pp. 557-566.
14. Kloks, T., Kratsch, D., & M̈uller, H. (2000), 'Finding and counting small induced subgraphs efficiently,' Information Processing Letters, 74(3-4), pp.115-121
15. Lenstra, J. K., Shmoys, D. B., & Tardos., É. (1990), 'Approximation algorithms for scheduling unrelated parallel machines', Mathematical Programming, 46(3), 259-271, 1990.
16. Lichtenstein, D. (1982), 'Planar formulae and their uses', SIAM Journal on Computing, 11(2), pp. 329-343.
17. Mitchell, S.L. (1979), 'Linear algorithms to recognize outerplanar and maximal outerplanar graphs', Information Processing Letters, 9, pp. 229-232.
18. O'Rourke, J. (1987), Art Gallery Theorems and Algorithms, Oxford University Press.
19. Schuurman, P., & Woeginger, G. J. (1999), 'Polynomial time approximation algorithms for machine scheduling: Ten open problems,' J. Scheduling, 2, pp. 203-213.
20. Venkateswaran, V. (2004), Minimizing maximum indegree, Discrete Applied Mathematics, 143(1-3), pp. 374-378.
21. Valdes, J., Tarjan, R.E., & Lawler, E.L. (1982), 'The recognition of series-parallel digraphs' SIAM J. Computing, 11, pp. 298-313.
22. Wimer, T.V. & Hedetniemi, S.T. (1988), 'K-terminal recursive families of graphs' Congressue Numerantium, 63, pp. 161-176.