Registro:

Referencias:

• Aho, A.V., Hopcroft, J.E., Ullman, J.D., (1974) The Design and Analysis of Computer Algorithms, , Addison-Wesley, Reading, Massachusetts
• Bang-Jensen, J., Huang, J., Yeo, A., Convex-round and concave-round graphs (2000) SIAM J. Discrete Math., 13, pp. 179-193
• Booth, S., Lueker, S., Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (1976) J. Comput. Syst. Sci., 13, pp. 335-379
• Chen, L., Graph isomorphism and identification matrices: Parallel algorithms (1996) IEEE Transactions on Parallel and Distributed Systems, 7 (3), pp. 308-319
• Chen, L., A selected tour of the theory of identification matrices (2000) Theor. Comput. Sci., 240, pp. 299-318
• Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., (2009) Introduction to Algorithms, , The MIT Press, Boston
• Cunningham, W.H., Edmonds, J., A combinatorial decomposition theory (1980) Canadian J. Math., 32, pp. 734-765
• Curtis, A.R., (2007) Linear-time Graph Algorithms for Chordal Comparability Graphs and Helly Circular Arc Graphs, , Master's thesis, Colorado State University
• Eschen, E.M., (1997) Circular-arc Graph Recognition and Related Problems, , PhD thesis, Department of Computer Science, Vanderbilt University
• Fulkerson, D.R., Gross, O., Incidence matrices and interval graphs (1965) Pacific J. Math., 15, pp. 835-855
• Gavril, F., Algorithms on circular-arc graphs (1974) Networks, 4, pp. 357-369
• Gioan, E., Paul, C., Tedder, M., Corneil, D.G., Practical and efficient circle graph recognition (2013) Algorithmica, pp. 1-30
• Golumbic, M.C., (1980) Algorithmic Graph Theory and Perfect Graphs, , Academic Press, New York
• Harel Dov, Tarjan Robert Endre, Fast algorithms for finding nearest common ancestors (1984) SIAM Journal on Computing, 13 (2), pp. 338-355
• Hsu, W.L., O(mn) algorithms for the recognition and isomorphism problems on circular-arc graphs (1995) SIAM J. Comput., 24, pp. 411-439
• Hsu, W.L., (2008), Personal communication; Hsu, W.L., McConnell, R.M., PC trees and circular-ones arrangements (2003) Theor. Comput. Sci., 296, pp. 59-74
• Joeris, B.L., Lin, M., McConnell, R.M., Spinrad, J.P., Szwarcfiter, J.L., Linear-time recognition of helly circular-arc models and graphs (2011) Algorithmica, 59, pp. 215-239
• Kaplan, H., Nussbaum, Y., Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (2009) Discrete Appl. Math., 157, pp. 3216-3230
• Klein, P.N., Efficient parallel algorithms for chordal graphs (1996) SIAM Journal on Computing, 25 (4), pp. 797-827
• Köbler, J., Kuhnert, S., Laubner, B., Verbitsky, O., Interval graphs: Canonical representations in logspace (2011) SIAM J. Comput., 40, pp. 1292-1315
• Köbler, J., Kuhnert, S., Verbitsky, O., Solving the canonical representation and star system problems for proper circular-arc graphs in log-space (2012) Foundations of Software Technology and Theoretical Computer Science (FSTTCS '12), 18, pp. 387-399. , D. D'Souza, T. Kavitha, and J. Radhakrishnan, editors, of Leibniz International Proceedings in Informatics (LIPIcs)
• Korte, N., Möhring, R.H., An incremental linear-time algorithm for recognizing interval graphs (1989) SIAM J. Comput., pp. 68-81
• Lin, M., McConnell, R.M., Soulignac, F.J., Szwarcfiter, J.L., On cliques of helly circular-arc graphs (2008) The IV Latin-American Algorithms, Graphs, and Optimization Symposium, Electron. Notes in Discrete Math., 30, pp. 117-122
• Lin, M., Soulignac, F.J., Szwarcfiter, J.L., A simple linear time algorithm for the isomorphism problem on proper circular-arc graphs (2008) 11th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science (SWAT '08), 5124, pp. 355-366. , J. Gudmundsson, editor, of Lecture Notes in Computer Science
• Lin, M., Szwarcfiter, J.L., Unit Circular-arc graph representations and feasible circulations (2008) SIAM J. Discrete Math., 22, pp. 409-423
• Lueker, G.S., Booth, K.S., A linear time algorithm for deciding interval graph isomorphism (1979) J. ACM, 26, pp. 183-195
• McConnell, R.M., A certifying algorithm for the consecutive-ones property (2004) 15th Annual ACMSIAM Symposium on Discrete Algorithms (SODA '04), pp. 768-777
• McConnell, R.M., De Montgolfier, F., Algebraic operations on PQ trees and modular decomposition trees (2005) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), LNCS 3787, pp. 421-432. , DOI 10.1007/11604686-37, Graph-Theoretic Concepts in Computer Science - 31st International Workshop, WG 2005, Revised Selected Papers
• Nussbaum, Y., From a circular-arc model to a proper circular-arc model (2008) 34th Workshop on Graph Theoretic Concepts in Computer Science (WG '08), 5344, pp. 324-335. , H. Broersma, T. Erlebach, T. Friedetzky, and D. Paulusma, editors, of Lecture Notes in Computer Science
• Shih, W.K., Hsu, W.K., A new planarity test (1999) Theor. Comput. Sci., 223, pp. 179-191
• Shiloach, Y., Fast canonization of circular strings (1981) J. Algorithms, 2, pp. 107-121
• Spinrad, J., Recognition of circle graphs (1994) J. Algorithms, 16, pp. 264-282
• Tucker, A., Matrix characterizations of circular-arc graphs (1971) Pacific J. Math, 39, pp. 535-545
• Wu, T.H., (1983) An O(n3) Isomorphism Test for Circular-arc Graphs, , PhD thesis, Applied Mathematics and Statistics, SUNY-Stonybrook

Citas:

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

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

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

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