Contributors: Centre d'études et de recherche en informatique et communications (CEDRIC), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers CNAM (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM), Centre d'économie de la Sorbonne (CES), Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS)
Superior Title: https://shs.hal.science/halshs-00270623 ; 2008.
Subject Terms: Three, four, tree, algorithm, triangle-free graph, trois, quatre, arbre, algorithme, 3-in-a-tree, 4-in-a-tree, graphes sans triangles, 05 - Combinatorics/05C - Graph theory/05C75 - Structural characterization of types of graphs 05 - Combinatorics/05C - Graph theory/05C85 - Graph algorithms 05 - Combinatorics/05C - Graph theory/05C05 - Trees 68 - Computer science/68R - Discrete mathematics in relation to computer science/68R10 - Graph theory 90 - Operations research, mathematical programming/90C - Mathematical programming/90C35 - Programming involving graphs or networks, [SHS.ECO]Humanities and Social Sciences/Economics and Finance, [SHS.STAT]Humanities and Social Sciences/Methods and statistics, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Relation: halshs-00270623; https://shs.hal.science/halshs-00270623; https://shs.hal.science/halshs-00270623/document; https://shs.hal.science/halshs-00270623/file/B08023.pdf
Availability:
https://shs.hal.science/halshs-00270623
https://shs.hal.science/halshs-00270623/document
https://shs.hal.science/halshs-00270623/file/B08023.pdf
Contributors: Centre d'études et de recherche en informatique et communications (CEDRIC), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers CNAM (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM), Centre d'économie de la Sorbonne (CES), Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS)
Superior Title: https://shs.hal.science/halshs-00270623 ; 2008.
Subject Terms: Three, four, tree, algorithm, triangle-free graph, trois, quatre, arbre, algorithme, 3-in-a-tree, 4-in-a-tree, graphes sans triangles, 05 - Combinatorics/05C - Graph theory/05C75 - Structural characterization of types of graphs 05 - Combinatorics/05C - Graph theory/05C85 - Graph algorithms 05 - Combinatorics/05C - Graph theory/05C05 - Trees 68 - Computer science/68R - Discrete mathematics in relation to computer science/68R10 - Graph theory 90 - Operations research, mathematical programming/90C - Mathematical programming/90C35 - Programming involving graphs or networks, [SHS.ECO]Humanities and Social Sciences/Economics and Finance, [SHS.STAT]Humanities and Social Sciences/Methods and statistics, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Relation: halshs-00270623; https://shs.hal.science/halshs-00270623; https://shs.hal.science/halshs-00270623/document; https://shs.hal.science/halshs-00270623/file/B08023.pdf
Availability:
https://shs.hal.science/halshs-00270623
https://shs.hal.science/halshs-00270623/document
https://shs.hal.science/halshs-00270623/file/B08023.pdf
Contributors: Centre d'études et de recherche en informatique et communications (CEDRIC), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers CNAM (CNAM), Centre d'économie de la Sorbonne (CES), Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS)
Superior Title: https://halshs.archives-ouvertes.fr/halshs-00270623 ; 2008.
Subject Terms: four, tree, algorithm, triangle-free graph, Three, trois, quatre, arbre, algorithme, 3-in-a-tree, 4-in-a-tree, graphes sans triangles, 05 - Combinatorics/05C - Graph theory/05C75 - Structural characterization of types of graphs 05 - Combinatorics/05C - Graph theory/05C85 - Graph algorithms 05 - Combinatorics/05C - Graph theory/05C05 - Trees 68 - Computer science/68R - Discrete mathematics in relation to computer science/68R10 - Graph theory 90 - Operations research, mathematical programming/90C - Mathematical programming/90C35 - Programming involving graphs or networks, [SHS.ECO]Humanities and Social Sciences/Economics and Finance, [SHS.STAT]Humanities and Social Sciences/Methods and statistics, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Relation: halshs-00270623; https://halshs.archives-ouvertes.fr/halshs-00270623; https://halshs.archives-ouvertes.fr/halshs-00270623/document; https://halshs.archives-ouvertes.fr/halshs-00270623/file/B08023.pdf
Availability:
https://halshs.archives-ouvertes.fr/halshs-00270623
https://halshs.archives-ouvertes.fr/halshs-00270623/document
https://halshs.archives-ouvertes.fr/halshs-00270623/file/B08023.pdf
Contributors: Optimisation Combinatoire (G-SCOP_OC), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Princeton University, Centre d'économie de la Sorbonne (CES), Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS), Centre d'Economie de la Sorbonne - CES UMR 8174
Superior Title: ISSN: 1955-611X.
Subject Terms: Detection, induced, subgraph, sous-graphe, induit, détection, Classification AMS 05 - Combinatorics/05C - Graph theory/05C85 - Graph algorithms 68 - Computer science/68R - Discrete mathematics in relation to computer science/68R10 - Graph theory 68 - Computer science/68W - Algorithms in computer science/68W05 - Nonnumerical algorithms 90 - Operations research, mathematical programming/90C - Mathematical programming/90C35 - Programming involving graphs or networks, [SHS.ECO]Humanities and Social Sciences/Economics and Finance, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Relation: halshs-00180953; https://shs.hal.science/halshs-00180953; https://shs.hal.science/halshs-00180953/document; https://shs.hal.science/halshs-00180953/file/B07049.pdf
Availability:
https://shs.hal.science/halshs-00180953
https://shs.hal.science/halshs-00180953/document
https://shs.hal.science/halshs-00180953/file/B07049.pdf
Contributors: Optimisation Combinatoire (G-SCOP_OC), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Princeton University, Centre d'économie de la Sorbonne (CES), Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS), Centre d'Economie de la Sorbonne - CES UMR 8174
Superior Title: ISSN: 1955-611X.
Subject Terms: Detection, induced, subgraph, sous-graphe, induit, détection, Classification AMS 05 - Combinatorics/05C - Graph theory/05C85 - Graph algorithms 68 - Computer science/68R - Discrete mathematics in relation to computer science/68R10 - Graph theory 68 - Computer science/68W - Algorithms in computer science/68W05 - Nonnumerical algorithms 90 - Operations research, mathematical programming/90C - Mathematical programming/90C35 - Programming involving graphs or networks, [SHS.ECO]Humanities and Social Sciences/Economics and Finance, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Relation: halshs-00180953; https://shs.hal.science/halshs-00180953; https://shs.hal.science/halshs-00180953/document; https://shs.hal.science/halshs-00180953/file/B07049.pdf
Availability:
https://shs.hal.science/halshs-00180953
https://shs.hal.science/halshs-00180953/document
https://shs.hal.science/halshs-00180953/file/B07049.pdf
Contributors: Laboratoire Leibniz (Leibniz - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Centre d'économie de la Sorbonne (CES), Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS), School of Computing Leeds, University of Leeds, UMS 1814 Centre de documentation de la Maison des Sciences Economiques
Superior Title: ISSN: 1624-0340 ; Cahiers de la Maison des Sciences Economiques ; https://shs.hal.science/halshs-00130439 ; 2006.
Subject Terms: Recognition algorithm, star decompositions, perfect graphs, combinatorial algorithms, maximum weight clique algorithm, algorithme, graphe parfait, algorithme combinatoire, Algorithme de reconnaissance, décomposition par étoile, clique de taille maximum, 68 - Computer science/68R - Discrete mathematics in relation to computer science/68R10 - Graph theory (including graph drawing) in computer science 68 - Computer science/68Q - Theory of computing/68Q25 - Analysis of algorithms and problem complexity 05 - Combinatorics/05C - Graph theory/05C85 - Graph algorithms (graph-theoretic aspects) 05 - Combinatorics/05C - Graph theory/05C17 - Perfect graphs 90 - Operations research, mathematical programming/90C - Mathematical programming/90C27 - Combinatorial optimization, [SHS.ECO]Humanities and Social Sciences/Economics and Finance
Relation: halshs-00130439; https://shs.hal.science/halshs-00130439; https://shs.hal.science/halshs-00130439/document; https://shs.hal.science/halshs-00130439/file/B06085.pdf
Availability:
https://shs.hal.science/halshs-00130439
https://shs.hal.science/halshs-00130439/document
https://shs.hal.science/halshs-00130439/file/B06085.pdf
Contributors: Laboratoire Leibniz (Leibniz - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Centre d'économie de la Sorbonne (CES), Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS), School of Computing Leeds, University of Leeds, UMS 1814 Centre de documentation de la Maison des Sciences Economiques
Superior Title: ISSN: 1624-0340 ; Cahiers de la Maison des Sciences Economiques ; https://shs.hal.science/halshs-00130439 ; 2006.
Subject Terms: Recognition algorithm, star decompositions, perfect graphs, combinatorial algorithms, maximum weight clique algorithm, algorithme, graphe parfait, algorithme combinatoire, Algorithme de reconnaissance, décomposition par étoile, clique de taille maximum, 68 - Computer science/68R - Discrete mathematics in relation to computer science/68R10 - Graph theory (including graph drawing) in computer science 68 - Computer science/68Q - Theory of computing/68Q25 - Analysis of algorithms and problem complexity 05 - Combinatorics/05C - Graph theory/05C85 - Graph algorithms (graph-theoretic aspects) 05 - Combinatorics/05C - Graph theory/05C17 - Perfect graphs 90 - Operations research, mathematical programming/90C - Mathematical programming/90C27 - Combinatorial optimization, [SHS.ECO]Humanities and Social Sciences/Economics and Finance
Relation: halshs-00130439; https://shs.hal.science/halshs-00130439; https://shs.hal.science/halshs-00130439/document; https://shs.hal.science/halshs-00130439/file/B06085.pdf
Availability:
https://shs.hal.science/halshs-00130439
https://shs.hal.science/halshs-00130439/document
https://shs.hal.science/halshs-00130439/file/B06085.pdf
Contributors: Laboratoire Leibniz (Leibniz - IMAG), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Centre d'économie de la Sorbonne (CES), Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS), School of Computing Leeds, University of Leeds, UMS 1814 Centre de documentation de la Maison des Sciences Economiques
Superior Title: ISSN: 1624-0340 ; Cahiers de la Maison des Sciences Economiques ; https://halshs.archives-ouvertes.fr/halshs-00130439 ; 2006.
Subject Terms: Recognition algorithm, maximum weight clique algorithm, combinatorial algorithms, perfect graphs, star decompositions, graphe parfait, algorithme combinatoire, algorithme, clique de taille maximum, décomposition par étoile, Algorithme de reconnaissance, 68 - Computer science/68R - Discrete mathematics in relation to computer science/68R10 - Graph theory (including graph drawing) in computer science 68 - Computer science/68Q - Theory of computing/68Q25 - Analysis of algorithms and problem complexity 05 - Combinatorics/05C - Graph theory/05C85 - Graph algorithms (graph-theoretic aspects) 05 - Combinatorics/05C - Graph theory/05C17 - Perfect graphs 90 - Operations research, mathematical programming/90C - Mathematical programming/90C27 - Combinatorial optimization, [SHS.ECO]Humanities and Social Sciences/Economics and Finance
Relation: halshs-00130439; https://halshs.archives-ouvertes.fr/halshs-00130439; https://halshs.archives-ouvertes.fr/halshs-00130439/document; https://halshs.archives-ouvertes.fr/halshs-00130439/file/B06085.pdf
Availability:
https://halshs.archives-ouvertes.fr/halshs-00130439
https://halshs.archives-ouvertes.fr/halshs-00130439/document
https://halshs.archives-ouvertes.fr/halshs-00130439/file/B06085.pdf