المؤلفون: Köbler, Johannes, Kuhnert, Sebastian, Verbitsky, Oleg

المساهمون: Johannes Köbler and Sebastian Kuhnert and Oleg Verbitsky

مصطلحات موضوعية: Proper circular-arc graphs, graph isomorphism, canonization, circular ones property, logspace complexity

وصف الملف: application/pdf

العلاقة: Is Part Of LIPIcs, Volume 18, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012); urn:nbn:de:0030-drops-38757; https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2012.387Test

الإتاحة: https://doi.org/10.4230/LIPIcs.FSTTCS.2012.387Test
https://nbn-resolving.org/urn:nbn:de:0030-drops-38757Test

المؤلفون: Gambette, Philippe, Vialette, Stéphane

المساهمون: Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Algorithmics, Régulation de l'expression génétique (REG), Département de Biologie - ENS Paris, École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Département de Biologie - ENS Paris, Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)

المصدر: Lecture Notes In Computer Science ; 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07) ; https://hal.science/hal-00141338Test ; 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07), ?, Jun 2007, Dornburg, Germany. pp.55-65, ⟨10.1007/978-3-540-74839-7_6⟩

مصطلحات موضوعية: 2-interval graphs, graph classes, line graphs, quasi-line graphs, claw-free graphs, circular interval graphs, proper circular-arc graphs, bioinformatics, scheduling, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM]

جغرافية الموضوع: Dornburg, Germany

العلاقة: info:eu-repo/semantics/altIdentifier/arxiv/0704.1571; hal-00141338; https://hal.science/hal-00141338Test; https://hal.science/hal-00141338v2/documentTest; https://hal.science/hal-00141338v2/file/Paper.pdfTest; ARXIV: 0704.1571

الإتاحة: https://doi.org/10.1007/978-3-540-74839-7_6Test
https://hal.science/hal-00141338Test
https://hal.science/hal-00141338v2/documentTest
https://hal.science/hal-00141338v2/file/Paper.pdfTest

المؤلفون: Hsu, Kevin

مرشدي الرسالة: Huang, Jing

مصطلحات موضوعية: graph theory, mathematics, discrete mathematics, graph orientations, proper interval graphs, proper circular-arc graphs, local tournaments, acyclic local tournaments, orientation completion problem, combinatorics

وصف الملف: application/pdf

الإتاحة: http://hdl.handle.net/1828/12024Test

المؤلفون: Lin, M.C., Szwarcfiter, J.L.

المصدر: Discrete Math 2009;309(18):5618-5635

مصطلحات موضوعية: Algorithms, Circular-arc graphs, Co-bipartite circular-arc graphs, Helly circular-arc graphs, Proper circular-arc graphs, Unit circular-arc graphs, Surveys, Cavity resonators

وصف الملف: application/pdf

العلاقة: http://hdl.handle.net/20.500.12110/paper_0012365X_v309_n18_p5618_LinTest; http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0012365X_v309_n18_p5618_Lin_oaiTest

الإتاحة: https://doi.org/20.500.12110/paper_0012365X_v309_n18_p5618_LinTest
https://hdl.handle.net/20.500.12110/paper_0012365X_v309_n18_p5618_LinTest
http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0012365X_v309_n18_p5618_Lin_oaiTest

المؤلفون: Guillermo Durán A, Agustín Gravano B, Ross M. Mcconnell C, Jeremy Spinrad D, Alan Tucker E

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www1.cs.columbia.edu/~agus/files/duran_et_al_2006.pdfTest.

مصطلحات موضوعية: Circular-arc graphs, Graph algorithms, Polynomial recognition, Proper circular-arc graphs, Unit circular-arc

وصف الملف: application/pdf

العلاقة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.7061Test; http://www1.cs.columbia.edu/~agus/files/duran_et_al_2006.pdfTest

الإتاحة: http://www1.cs.columbia.edu/~agus/files/duran_et_al_2006.pdfTest

المؤلفون: Francisco J. Soulignac

المصدر: CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET

مصطلحات موضوعية: FOS: Computer and information sciences, General Computer Science, Matemáticas, 68R10, ROUND GRAPHS, Combinatorics, purl.org/becyt/ford/1 [https], Dynamic problem, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, MINIMAL FORBIDDEN INDUCED SUBGRAPHS, Computer Science - Data Structures and Algorithms, CO-CONNECTIVITY, Data Structures and Algorithms (cs.DS), DYNAMIC RECOGNITION, Mathematics, Applied Mathematics, purl.org/becyt/ford/1.1 [https], Matemática Aplicada, purl.org/becyt/ford/1.2 [https], Binary logarithm, Graph, Computer Science Applications, Vertex (geometry), Ciencias de la Computación, PROPER CIRCULAR-ARC GRAPHS, Ciencias de la Computación e Información, CIENCIAS NATURALES Y EXACTAS, MathematicsofComputing_DISCRETEMATHEMATICS

وصف الملف: application/pdf

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89048ca7d3ec792ff752564f901d7cb6Test
https://link.springer.com/article/10.1007/s00453-013-9835-7Test

المؤلفون: Jayme Luiz Szwarcfiter, Min Chih Lin, Francisco J. Soulignac

مصطلحات موضوعية: Discrete mathematics, Efficient algorithm, Helly family, Matemáticas, Applied Mathematics, Matemática Aplicada, Computer Science::Computational Geometry, Intersection graph, Graph, Ciencias de la Computación, Combinatorics, Arc (geometry), Helly's theorem, UNIT CIRCULAR-ARC GRAPHS, Computer Science::Discrete Mathematics, PROPER CIRCULAR-ARC GRAPHS, Ciencias de la Computación e Información, HELLY CIRCULAR-ARC GRAPHS, Mathematics::Metric Geometry, Discrete Mathematics and Combinatorics, NORMAL CIRCULAR-ARC GRAPHS, CIENCIAS NATURALES Y EXACTAS, Mathematics

وصف الملف: application/pdf

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::296f7887d2f4c6175844d9ac024bfc7aTest
https://www.sciencedirect.com/science/article/pii/S0166218X12004295Test

المؤلفون: Soulignac, Francisco Juan

المساهمون: Lin, Min Chih

المصدر: Biblioteca Digital (UBA-FCEN)
Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron:UBA-FCEN

مصطلحات موضوعية: ALGORITMOS DE RECONOCIMIENTO DINAMICOS, RECOGNITION ALGORITHMS, POWERS OF PATHS, ISOMORPHISM PROBLEM, K-BEHAVIOR, GRAFOS ARCO-CIRCULARES HELLY, GRAFOS CLIQUE, POTENCIAS DE CAMINOS, GRAFOS ARCO-CIRCULARES PROPIOS, ALGORITMOS DE RECONOCIMIENTO, CLIQUE GRAPHS, POWER OF CYCLES, COMPORTAMIENTO DEL OPERADOR CLIQUE ITERADO, PROPER CIRCULAR-ARC GRAPHS, HELLY CIRCULAR-ARC GRAPHS, INTERVAL GRAPHS, DYNAMIC RECOGNITION ALGORITHMS, ALGORITMOS DE TRANSFORMACION, GRAFOS DE INTERVALOS, POTENCIAS DE CICLOS, TRANSFORMATION ALGORITHMS, PROBLEMA DE ISOMORFISMO

وصف الملف: application/pdf

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=od______3056::d85857536dd5ed3317f3a6a57afd182cTest

المؤلفون: Philippe Gambette, Vialette, S.

المساهمون: Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Algorithmics, Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)

المصدر: Lecture Notes In Computer Science
33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07)
33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07), ?, Jun 2007, Dornburg, Germany. pp.55-65, ⟨10.1007/978-3-540-74839-7_6⟩
Scopus-Elsevier

مصطلحات موضوعية: FOS: Computer and information sciences, 2-interval graphs, Discrete Mathematics (cs.DM), graph classes, line graphs, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], quasi-line graphs, bioinformatics, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], Quantitative Biology - Quantitative Methods, circular interval graphs, claw-free graphs, proper circular-arc graphs, FOS: Biological sciences, scheduling, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Quantitative Methods (q-bio.QM), MathematicsofComputing_DISCRETEMATHEMATICS, Computer Science - Discrete Mathematics

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30acd36399bfce62c2a938d46db5e084Test
http://arxiv.org/abs/0704.1571Test

المؤلفون: Soulignac, Francisco Juan

المساهمون: Lin, Min Chih

مصطلحات موضوعية: GRAFOS ARCO-CIRCULARES PROPIOS, GRAFOS ARCO-CIRCULARES HELLY, GRAFOS DE INTERVALOS, POTENCIAS DE CAMINOS, POTENCIAS DE CICLOS, ALGORITMOS DE RECONOCIMIENTO, ALGORITMOS DE TRANSFORMACION, ALGORITMOS DE RECONOCIMIENTO DINAMICOS, PROBLEMA DE ISOMORFISMO, GRAFOS CLIQUE, COMPORTAMIENTO DEL OPERADOR CLIQUE ITERADO, PROPER CIRCULAR-ARC GRAPHS, HELLY CIRCULAR-ARC GRAPHS, INTERVAL GRAPHS, POWERS OF PATHS, POWER OF CYCLES, RECOGNITION ALGORITHMS, TRANSFORMATION ALGORITHMS, DYNAMIC RECOGNITION ALGORITHMS, ISOMORPHISM PROBLEM, CLIQUE GRAPHS, K-BEHAVIOR

وصف الملف: application/pdf

العلاقة: https://hdl.handle.net/20.500.12110/tesis_n4660_SoulignacTest; http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=aextesis&d=tesis_n4660_Soulignac_oaiTest

الإتاحة: https://doi.org/20.500.12110/tesis_n4660_SoulignacTest
https://hdl.handle.net/20.500.12110/tesis_n4660_SoulignacTest
http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=aextesis&d=tesis_n4660_Soulignac_oaiTest