On the L(h, K)-labeling of co-comparability graphs and circular-arc graphs

Networks

Volumn 53, Issue 1, 2009, Pages 27-34

  Calamoneri, Tiziana ^a   Caminiti, Saverio ^a   Petreschi, Rossella ^a   Olariu, Stephan ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b ECS Building   (United States)

Author keywords

Circular arc graphs; Co comparability graphs; Interval graphs; L(h,k) Labeling

Indexed keywords

ADJACENT VERTICES; CIRCULAR-ARC GRAPHS; CO-COMPARABILITY GRAPHS; DECISION VERSIONS; GRAPH G; INTERVAL GRAPHS; L(H,K)-LABELING; NON-NEGATIVE INTEGERS; NP-COMPLETE;

LABELS;

CAVITY RESONATORS;

EID: 61449156284     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20257     Document Type: Article

References (42)

1. K.A. Aly and P.W. Dowd, A class of scalable optical interconnection networks through discrete broadcast-select multidomain WDM, Proc IEEE INFOCOM, Toronto, Canada, 1994, pp. 392-399.
2. K.A. Baker, P.C. Fishburn, and F.S. Roberts, Partial orders of dimension two, Networks 2 (1971), 11-28.
3. A.A. Bertossi, C.M. Pinotti, and R. Rizzi, Channel assignment on strongly-simplieial graphs, Proc Int Parallel and Distributed Processing Symp (IPDPS '03), Nice, France, 2003.
4. G.E. Blelloch, P.B. Gibbons, Y. Mattias, and M. Zagha, Accounting for memory bank contentions and delay in highbandwidth multiprocessors, IEEE Trans Parallel Distributed Syst 8 (1997), 943-958.
5. J.A. Bondy and U.S.R. Murty, Graph theory with applications, American Elsevier Publishing Company, Inc., New York, 1976.
6. 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.
7. K.S. Booth and G.S. Lueker, A linear time algorithm for deciding interval graph isomorphism, J ACM 26 (1979), 183-195.
8. T. Calamoneri, Exact solution of a class of frequency assignment problems in cellular networks and other regular grids, Discrete Math Theor Comput Sci 8 (2006), 141-158.
9. T. Calamoneri, The L(h, k)-labelling problem: an annotated bibliography and a survey, The Computer Journal 49 (2006), 585-608. A continuously updated version is available on http://www.dsi.uniromal.it/~calamo/survey.html.
10. D.G. Corneil and P.A. Kamula, Extensions of permutation and interval graphs, Proc 18th Southeastern Conference on Combinatorics, Graph Theory and Computing, 1987, pp. 267-276.
11. D.G. Corneil, E. Koehler, S. Olariu, and L. Stewart, On subfamilies of AT-free graphs, SIAM J Discrete Math 20 (2006), 241-253.
12. D.G. Corneil, S. Olariu, and L. Stewart, Asteroidal triple-free graphs, SIAM J Discrete Math 10 (1997), 399-430.
13. P. Damaschke, Distance in cocomparability graphs and their powers, Disc Appl Math 35 (1992), 67-72.
14. S.K. Das, I. Finocchi, and R. Petreschi, Conflict-free staraccess in parallel memory systems, J Parallel Distributed Comput 66 (2006), 1431-1441.
15. I. Degan, M.C. Golumbic, and R.Y Pinter, Trapezoid graphs and their coloring, Discrete Appl Math 21 (1988), 35-46.
16. S. Even, A. Pnueli, and A. Lempel, Permutation graphs and transitive graphs, J ACM 19 (1972), 400-410.
17. T. Gallai, Transitiv orientierbare Graphen, Acta Math Acad Sci Hungar 18 (1967), 25-66.
18. M.R. Garey and D.S. Johnson, Computers and intractability - a guide to the theory of NP-completeness, W.H. Freeman and Co., San Francisco, 1979.
19. M.R. Garey, D.S. Johnson, G.L. Miller, and C.H. Papadimitriou, The complexity of coloring circular arcs and chords, SIAM J Algebraic Discrete Methods 1 (1980), 185-200.
20. M.C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
21. M.C. Golumbic, H. Kaplan, and R. Shamir, Graph sandwich problems, J Algorithms 19 (1995), 449-473.
22. P.W. Goldberg, M.C. Golumbic, H. Kaplan, and R. Shamir, Four strikes against physical mapping of DNA, J Computat Biol 2 (1995), 139-152.
23. M.C. Golumbic, C.L. Monma, and W.T. Trotter, Jr., Tolerance graphs, Discrete Appl Math 9 (1984). 157-170.
24. J.R. Griggs and R.K. Yeh, Labeling graphs with a condition at distance 2, SIAM J Discrete Math 5 (1992), 586-595.
25. J. van den Heuvel, R.A. Leese, and M.A. Shepherd, Graph labelling and radio channel assignment, J Graph Theory 29 (1998), 263-283.
26. R.E. Jamison and R. Laskar, Elimination orderings of chordal graphs, Proc of the Seminar on Combinatorics and Applications, Calcutta, 1982, pp. 192-200.
27. T.R. Jensen and B. Toft, Graph coloring problems, Wiley, New York, 1995.
28. D. Kratsch and L. Stewart, Domination on cocomparability graphs, SIAM J Discrete Math 6 (1993), 400-417.
29. C.G. Lekkerkerker and J.C. Boland, Representation of a finite graph by a set of intervals on the real line, Fundam Math 51 (1962), 45-64.
30. P. Looges and S. Olariu, Optimal greedy algorithms for indifference graphs, Comput Math Appl 25 (1993), 15-25.
31. S.T. McCormick, Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem, Math Program 26 (1983), 153-171.
32. R.M. Karp, Mapping the genome: some combinatorial problems arising in molecular biology, Proc. 25th Ann. ACM Symp. on Theory of Comp. (STOC '93), San Diego, CA, 1993, pp. 278-285.
33. S. Olariu, An optimal greedy heuristic to color interval graphs, Inform Process Lett 37 (1991), 21-25.
34. I. Pe'er and R. Shamir, Interval graphs with side (and size) constraints, Proc European Symp on Algorithms (ESA '95), Lecture Notes in Computer Science, Vol. 979, Springer, Berlin, 1995, pp. 142-154.
35. I. Pe'er and R. Shamir, Realizing interval graphs with side and distance constraints, SIAM J Discrete Math 10 (1997), 662-687.
36. A. Raychauduri, On powers of interval and unit interval graphs, Congressus Numerantium 59 (1987), 235-242.
37. A. Raychauduri, On powers of strongly chordal and circular arc graphs, Ars Combinatoria 34 (1992), 147-160.
38. D.J. Rose, R.E. Tarjan, and G.S. Lueker, Algorithmic aspects of vertex elimination on graphs, SLAM J Comput 5 (1976), 266-283.
39. D. Sakai, Labeling chordal graphs: distance two condition, SLAM J Discrete Mathe 7 (1994), 133-140.
40. H.D. Shapiro, Theoretical limitations on the efficient use of parallel memories, IEEE Trans Comput 17 (1978), 421-428.
41. R.E. Tarjan and M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs, SIAM J Comput 13 (1984), 566-579.
42. P.J. Wan, Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network, J Combin Optim 1 (1997), 179-186.