Registro:

Referencias:

• Bang-Jensen, J., Hell, P., On the chordal proper circular-arc graphs (1994) Discrete Mathematics, 128, pp. 395-398
• Benzer, S., On the topology of genetic structure (1959) Proceedings of the National Academy of Sciences USA, 45, pp. 1607-1620
• Bonomo, F., Durán, G., Grippo, L.N., Safe, M.D., Partial characterizations of circular-arc graphs (2008) Electronic Notes in Discrete Mathematics, 30, pp. 45-50. , Proceedings of the IV Latin American Graphs and Optimization Symposium. LAGOS'07, Puerto Varas, Chile
• Booth, K.S., Lueker, G.S., Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms (1976) Journal of Computer System Sciences, 13, pp. 335-379
• Bransdstädt, A., Lee, V.B., Spinrad, J.P., Graph classes (1999) SIAM Monographs on Discrete Mathematics and Applications, , SIAM Publications
• Cogis, O., On the Ferrers dimension of a digraph (1982) Discrete Mathematics, 38, pp. 47-52
• Confessore, G., Dell'olmo, P., Giordani, S., An approximation result for a periodic allocation problem (2001) Discrete Applied Mathematics, 112, pp. 53-72
• Conitzer, V., Derryberry, J., Sandholm, T., Combinatorial auctions with structured item graphs (1994) Proceedings of the 19th National Conference on Artificial Intelligence, pp. 212-218
• Deng, X., Hell, P., Huang, J., Linear time representation algorithms for proper circular-arc graphs and proper interval graphs (1996) SIAM Journal of Computing, 25, pp. 390-403
• Durán, G., Lin, M.C., On some subclasses of circular-arc graphs (2000) Congressus Numerantium, 146, pp. 201-212
• Durán, G., Gravano, A., McConnell, R.M., Spinrad, J.P., Tucker, A., Polynomial time recognition of unit circular-arc graphs (2006) Journal of Algorithms, 58, pp. 67-78
• Durán, G., Lin, M.C., Mera, S., Szwarcfiter, J.L., Algorithms for clique-independent sets on subclasses of circular-arc graphs (2006) Discrete Applied Mathematics, 154, pp. 1783-1790
• Durán, G., Lin, M.C., Mera, S., Szwarcfiter, J.L., Algorithms for finding clique-transversals of graphs (2008) Annals of Operations Research, 157, pp. 37-45
• Eschen, E.M., Spinrad, J.P., An O (n 2 ) Algorithm for circular-arc graph recognition (1993) Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93, pp. 128-137
• Eschen, E.M., (1997) Circular-arc graph recognition and related problems, , Ph.D. Thesis, Department of Computer Science, Vanderbilt University
• Feder, T., Hell, P., Huang, J., List homomorphisms and circular-arc graphs (1999) Combinatorica, 19, pp. 487-505
• Gavril, F., Algorithms on circular-arc graphs (1974) Networks, 4, pp. 357-369
• Gilmore, P.G., Hoffman, A.J., A characterization of comparability graphs and interval graphs (1964) Canadian Journal of Mathematics, 16, pp. 539-548
• Golumbic, M.C., (2004) Algorithmic Graph Theory and Perfect Graphs. 2nd ed., , Academic Press
• Guttman, L., A basis for scaling quantitative data (1944) American Journal review, 9, pp. 139-150
• Habib, M., McConnell, R., Paul, C., Viennot, L., Lex-bfs and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (2000) Theoretical Computer Science, 234, pp. 59-84
• Hadwiger, H., Debrunner, H., Klee, V., (1964) Combinatorial Geometry in the Plane, , Holt Rinehardt and Winston, New York
• Hell, P., Bang-Jensen, J., Huang, J., Local tournaments and proper circular-arc graphs (1990) Lecture Notes in Computer Science, 450, pp. 101-109
• Hell, P., Huang, J., Lexicographic orientation and representation algorithms for comparability graphs, proper circular graphs and proper interval graphs (1995) Journal of Graph Theory, 20, pp. 361-374
• Hell, P., Huang, J., Two remarks on circular-arc graphs (1997) Graph and Combinatoric, 13, pp. 65-72
• Hell, P., Huang, J., Interval bigraphs and circular-arc graphs (2004) Journal of Graph Theory, 46, pp. 313-327
• Hell, P., Huang, J., Certifying LexBFS recognition algorithms for proper interval graphs and proper interval bigraphs (2004) SIAM Journal on Discrete Mathematics, 18, pp. 554-576
• Hsu, W.L., O (m n) algorithms for the recognition and isomorphism problems on circular-arc graphs (1995) SIAM Journal on Computing, 24, pp. 411-439
• Hsu, W.L., A simpler test for the consecutive ones property (2002) Journal of Algorithms, 43, pp. 1-16
• Hsu, W.L., McConnell, R.M., PC-trees and circular-ones arrangements (2004) Theoretical Computer Science, 296, pp. 99-116
• Huang, J., (1992) Tournament-like oriented graphs, , Ph.D. Thesis, Simon Fraser University, Burnaby, BC
• Huang, J., On the structure of local tournaments (1995) Journal of Combinatorial Theory B, 63, pp. 200-221
• Hubert, L., Some applications of graph theory and related non symmetric techniques to problems of approximate seriation: The case of symmetric proximity measures (1974) British Journal of Mathematical and Statistical Psychology, 27, pp. 133-153
• Joeris, B.C., McConnell, R.M., Spinrad, J.P., Helly circular-arc Graphs (2006) SIAM Conference on Discrete Mathematics, , Victoria
• Joeris, B.C., Lin, M.C., McConnell, R.M., Spinrad, J.P., Szwarcfiter, J.L., (2008) Characterizations and linear time recognition of Helly circular-arc graphs, , submitted for publication
• Kaplan, H., Nussbaum, Y., A simpler linear-time recognition of circular-arc graphs (2006) Lecture Notes in Computer Science, 4059, pp. 41-52. , Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT'06, 2006
• Kaplan, H., Nussbaum, Y., Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (2006) Lecture Notes in Computer Science, 4261, pp. 289-300. , Proceedings of the 32nd International Workshop on Graph Theoretic Concepts in Computer Science, WG'06, Bergen, Norway, 2006
• Klee, V., What are the intersection graphs of arcs in a circle? (1976) American Mathematical Monthly, 76, pp. 810-813
• Lin, M.C., McConnell, R.M., Soulignac, F., Szwarcfiter, J.L., On cliques of Helly circular-arc graphs (2008) Electronic Notes in Discrete Mathematics, 30, pp. 117-122. , Proceedings of the IV Latin American Graphs and Optimization Symposium. LAGOS'07, Puerto Varas, Chile, 2007
• Lin, M.C., Soulignac, F., Szwarcfiter, J.L., Proper Helly circular-arc graphs (2007) Lecture Notes in Computer Science, 4769, pp. 248-257. , Proceedings of the 33rd International Workshop on Graph Theoretic Concepts in Computer Science. WG'07, Jena, Germany, 2007
• Lin, M.C., Szwarcfiter, J.L., Efficient construction of unit circular-arc models (2006) Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, pp. 309-315. , Miami, Fl, USA
• Lin, M.C., Szwarcfiter, J.L., Characterizations and linear time recognition of Helly circular-arc graphs (2006) Lecture Notes in Computer Science, 4112, pp. 73-82. , Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON'06, Taipei, Taiwan, 2006
• Lin, M.C., Szwarcfiter, J.L., Unit circular-arc graph representations and feasible circulations (2008) SIAM Journal on Discrete Mathematics, 22 (1), pp. 409-423
• Luce, R.P., Periodic extensive measurement (1971) Composito Math., 23, pp. 189-198
• Ma, T.H., Spinrad, J.P., An O (n 2 ) algorithm for the undirected split decomposition (1994) Journal of Algorithms, 16, pp. 264-282
• Ma, T.H., Spinrad, J.P., On the 2-chain subgraph cover and related problems (1994) Journal of Algorithms, 17, pp. 251-268
• McConnell, R.M., Spinrad, J.P., Modular decomposition and transitive orientation (1999) Discrete Mathematics, 201, pp. 189-241
• McKee, T.A., Morris, F.R., (1999) SIAM Monographs on Discrete Mathematics and Applications, , SIAM Publications
• McConnell, R.M., Linear-time recognition of circular-arc graphs (2003) Algorithmica, 37 (2), pp. 93-147
• McConnell, R.M., A certifying algorithm for the consecutive ones property (2004) Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'04, pp. 716-770
• Mohring, R.H., Algorithmic aspects of comparability graphs and interval graphs (1985) Graphs and Order, pp. 41-101. , Rival. I. (Ed), Reidel, Boston
• Müller, H., Recognizing interval digraphs and interval bigraphs in polynomial time (1997) Discrete Applied Mathematics, 78, pp. 189-205
• Nirkhe, M.V., (1987) Efficient algorithms for circular-arc containment graphs, , M.Sc. Thesis, University of Maryland, Systems Research Center, College Park, MD, USA
• Nussbaum, Y., (2007) Recognition of circular-arc graphs and some subclasses, , M. Sc. Thesis, Tel-Aviv University, School of Computer Science, Tel-Aviv, Israel
• Paull, M.C., Unger, S.H., Minimizing the number of states in incompletely specified sequential functions (1959) IRE Transactions on Electronic Computers, EC-8, pp. 356-367
• Riguet, J., Des relations des Ferrers (1951) C. R. Acad. Sci. Paris, 232, p. 1729
• Roberts, F.S., Indifference graphs (1969) Proof Techniques in Graph Theory, , Harary F. (Ed), Academic Press
• Roberts, F.S., (1978) Graph Theory and its Applications to Problems of Society, , SIAM Publishing, Philadelphia
• Sen, M.K., Das, S., Roy, A.B., West, D.B., Interval digraphs: An analogue to interval graphs (1989) Journal of Graph Theory, 13, pp. 189-202
• Sen, M.K., Das, S., West, D.B., Circular digraphs: A characterization (1989) Journal of Graph Theory, 13, pp. 581-592
• Sen, M.K., Sanyal, B.K., West, D.B., Representing digraphs using intervals or circular arcs (1995) Discrete Mathematics, 147, pp. 235-245
• Skrien, D., A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs and nested interval graphs (1982) Journal of Graph Theory, 6, pp. 309-316
• Spinrad, J.P., Brandstadt, A., Stewart, L., Bipartite permutation graphs (1987) Discrete Applied Mathematics, 18, pp. 279-292
• Spinrad, J.P., Circular-arc graphs with clique cover number two (1988) Journal of Combinatorial Theory B, 44, pp. 300-306
• Spinrad, J.P., (2003) Fields Institute Monographs, 19. , American Mathematical Society
• Stahl, F., Circular genetic maps (1967) Journal Cell. Physiol., 70, pp. 1-12
• Stouffers, K., Scheduling of traffic lights-a new approach (1968) Transportation Res., 2, pp. 199-234
• Stefanakos, S., Erlebach, T., Routing in all-optical ring network revisited (2004) Proceedings of the 9th IEEE Symposium on Computers and Communications, pp. 288-293
• Trotter, W.T., Moore, J.I., Characterizations problems for graphs, partially ordered sets, lattices and families of sets (1976) Discrete Mathematics, 16, pp. 361-381
• Trotter, W.T., (1992) Combinatorics and Partially Ordered Sets-Dimension Theory, , Johns Hopkings University Press, Baltimore, London
• Tucker, A., (1969) Two characterizations of proper circular-arc graphs, , Ph.D. Thesis, Stanford University, Standford Operation Research Department, Stanford, Calinf, USA
• Tucker, A., Characterizing circular-arc graphs (1970) Bull. American Mathematical Society, 76, pp. 1257-1260
• Tucker, A., Matrix characterizations of circular-arc graphs (1971) Pacific Journal of Mathematics, 39, pp. 535-545
• Tucker, A., A structure theorem for the consecutive 1's property (1972) Journal of Combinatorial Theory, 12, pp. 153-162
• Tucker, A., Structure theorems for some circular-arc graphs (1974) Discrete Mathematics, 7, pp. 167-195
• Tucker, A., Circular-arc graphs: New uses and a new algorithm (1978) Lecture Notes in Mathematics, 642, pp. 580-589. , Theory and Application of Graphs
• Tucker, A., An efficient test for circular-arc graphs (1980) SIAM Journal on Computing, 9, pp. 1-24

Citas:

---------- APA ----------

---------- CHICAGO ----------

---------- MLA ----------

---------- VANCOUVER ----------