Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs
In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary graphs, and for two non-trivial subclasses, namely the cographs and the 3-leaf power graphs. Precisely, w...
Gespeichert in:
| Veröffentlicht in: | Discrete Applied Mathematics Jg. 160; H. 6; S. 708 - 733 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.04.2012
Elsevier |
| Schlagworte: | |
| ISSN: | 0166-218X, 1872-6771 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary graphs, and for two non-trivial subclasses, namely the cographs and the 3-leaf power graphs. Precisely, we give structural and incremental characterizations, leading to optimal fully dynamic recognition algorithms for vertex and edge modifications, for each of these classes. These results rely on the new combinatorial framework of graph-labelled trees used to represent the split decomposition of general graphs (and also the modular decomposition). The point of the paper is to use bijections between the aforementioned graph classes and graph-labelled trees whose nodes are labelled by cliques and stars. We mention that this bijective viewpoint yields directly an intersection model for the class of distance hereditary graphs.
► This paper propose new algorithmic and combinatorial results for graph classes which are totally decomposable for the split decomposition. ► We give strutural and (vertex/edge) incremental characterizations of distance hereditary graphs, cographs and 3-leaf power graphs ► We propose fully-dynamic recognition algorithms for distance hereditary graphs, cographs and 3-leaf power graphs ► These results rely on the new combinatorial framework of graph-labelled trees used to represent the split decomposition of general graphs. ► We use bijections between distance hereditary graphs and graph-labelled trees, yielding an intersection model for distance hereditary graphs. |
|---|---|
| AbstractList | In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary graphs, and for two non-trivial subclasses, namely the cographs and the 3-leaf power graphs. Precisely, we give structural and incremental characterizations, leading to optimal fully dynamic recognition algorithms for vertex and edge modifications, for each of these classes. These results rely on the new combinatorial framework of graph-labelled trees used to represent the split decomposition of general graphs (and also the modular decomposition). The point of the paper is to use bijections between the aforementioned graph classes and graph-labelled trees whose nodes are labelled by cliques and stars. We mention that this bijective viewpoint yields directly an intersection model for the class of distance hereditary graphs.
► This paper propose new algorithmic and combinatorial results for graph classes which are totally decomposable for the split decomposition. ► We give strutural and (vertex/edge) incremental characterizations of distance hereditary graphs, cographs and 3-leaf power graphs ► We propose fully-dynamic recognition algorithms for distance hereditary graphs, cographs and 3-leaf power graphs ► These results rely on the new combinatorial framework of graph-labelled trees used to represent the split decomposition of general graphs. ► We use bijections between distance hereditary graphs and graph-labelled trees, yielding an intersection model for distance hereditary graphs. In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary graphs, and for two non-trivial subclasses, namely the cographs and the 3-leaf power graphs. Precisely, we give strutural and incremental characterizations, leading to optimal fullydynamic recognition algorithms for vertex and edge modifications, for each of these classes. These results rely on the new combinatorial framework of graph-labelled trees used to represent the split decomposition of general graphs. The point of the paper is to use bijections between the aforementioned graph classes and graph-labelled trees whose nodes are labelled by cliques and stars. We mention that this bijective viewpoint yields directly an intersection model for the class of distance hereditary graphs. In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary graphs, and for two non-trivial subclasses, namely the cographs and the 3-leaf power graphs. Precisely, we give structural and incremental characterizations, leading to optimal fully dynamic recognition algorithms for vertex and edge modifications, for each of these classes. These results rely on the new combinatorial framework of graph-labelled trees used to represent the split decomposition of general graphs (and also the modular decomposition). The point of the paper is to use bijections between the aforementioned graph classes and graph-labelled trees whose nodes are labelled by cliques and stars. We mention that this bijective viewpoint yields directly an intersection model for the class of distance hereditary graphs. |
| Author | Gioan, Emeric Paul, Christophe |
| Author_xml | – sequence: 1 givenname: Emeric surname: Gioan fullname: Gioan, Emeric – sequence: 2 givenname: Christophe surname: Paul fullname: Paul, Christophe email: paul@lirmm.fr |
| BackLink | https://hal-lirmm.ccsd.cnrs.fr/lirmm-00783420$$DView record in HAL |
| BookMark | eNp9kcFq3DAQhkVJoJukD9Cbj4ViV5It2duewtI2hYUemkBvYiyPslpky5W0gS19-GrX6aWHnISk758ZvrkiF5OfkJC3jFaMMvlhXw0wVpwyVlFRUdq-IivWtbyUbcsuyCozsuSs-_maXMW4p5SyfFuRPz9mZ1MxoPbj7KNN1k8FTEPxGGDelQ56dA6HIgXE-LHY7CCAThjsbzih8cyag3PHYjhOMFpdgHv0wabdGAvjQ5F8gvP3cwvoHS7V4w25NOAivnk-r8nDl8_3m7ty-_3rt83tttS1lKkc1qgRBdWCd8Yw0XLTdUI0Brkw2ADWvWaMiVp3bcOHHqGX6142TX43uu_ra_J-qbsDp-ZgRwhH5cGqu9utcjaMo8rGurrh9Ill-t1Cz8H_OmBMarRRZw0woT9ElX2vpeCUy4y2C6qDjzGgUdqms5gUwLqMnmip9ipvR522o6g49cpJ9l_y31wvZT4tGcyuniwGFbXFSeNgA-qkBm9fSP8FniOtNg |
| CitedBy_id | crossref_primary_10_1007_s00453_021_00820_z crossref_primary_10_1016_j_ejc_2018_07_009 crossref_primary_10_1007_s00453_017_0290_8 crossref_primary_10_1016_j_jcss_2018_05_005 crossref_primary_10_1007_s13225_020_00448_4 crossref_primary_10_3897_mycokeys_115_145330 crossref_primary_10_1017_S0013091525100874 crossref_primary_10_1016_j_tcs_2021_07_040 crossref_primary_10_1007_s00453_013_9752_9 crossref_primary_10_1007_s00453_013_9745_8 crossref_primary_10_1007_s00453_016_0230_z crossref_primary_10_1145_3310228 |
| Cites_doi | 10.1007/BF02020961 10.1137/S0097539700372216 10.1137/0603021 10.1007/s004539900017 10.1016/0196-6774(86)90023-4 10.1007/BF02579301 10.1137/0214065 10.1016/j.ipl.2006.01.004 10.1007/s00453-008-9273-0 10.2168/LMCS-2(2:2)2006 10.1016/S0304-3975(00)00234-6 10.1016/0095-8956(87)90031-1 10.1016/0095-8956(86)90043-2 10.1016/j.ipl.2008.05.005 10.1006/jagm.1994.1007 10.1016/S0166-218X(99)00075-X 10.1016/0166-218X(90)90131-U 10.1016/j.jctb.2005.03.003 10.1137/1.9780898719796 10.4153/CJM-1980-057-7 10.1016/0012-365X(73)90100-3 10.1006/jagm.2000.1090 10.1006/jagm.2001.1195 10.1016/S0166-218X(03)00448-7 10.1016/0095-8956(74)90094-X 10.1016/j.cosrev.2010.01.001 10.1016/j.dam.2006.03.005 10.1016/S0012-365X(03)00232-2 |
| ContentType | Journal Article |
| Copyright | 2012 Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2012 – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | 6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 1XC |
| DOI | 10.1016/j.dam.2011.05.007 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1872-6771 |
| EndPage | 733 |
| ExternalDocumentID | oai:HAL:lirmm-00783420v1 10_1016_j_dam_2011_05_007 S0166218X11001892 |
| GrantInformation_xml | – fundername: French research grantid: ANR-06-BLAN-0148-01 |
| GroupedDBID | -~X 6I. AAFTH ADEZE AFTJW AI. ALMA_UNASSIGNED_HOLDINGS FA8 FDB OAUVE VH1 WUQ AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 1XC |
| ID | FETCH-LOGICAL-c366t-d9ecee50c528ff1572f88554fe25fe4ae3bc11153c8742dbeab69b6443bcfcbb3 |
| ISICitedReferencesCount | 26 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000302981900004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0166-218X |
| IngestDate | Tue Oct 14 20:13:16 EDT 2025 Thu Jul 10 22:28:05 EDT 2025 Sat Nov 29 02:59:30 EST 2025 Tue Nov 18 21:46:28 EST 2025 Sat Apr 29 22:45:08 EDT 2023 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Keywords | Distance hereditary graphs Split decomposition Fully dynamic algorithms |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c366t-d9ecee50c528ff1572f88554fe25fe4ae3bc11153c8742dbeab69b6443bcfcbb3 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ORCID | 0000-0001-6519-975X 0009-0007-3370-5460 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.dam.2011.05.007 |
| PQID | 1019652026 |
| PQPubID | 23500 |
| PageCount | 26 |
| ParticipantIDs | hal_primary_oai_HAL_lirmm_00783420v1 proquest_miscellaneous_1019652026 crossref_citationtrail_10_1016_j_dam_2011_05_007 crossref_primary_10_1016_j_dam_2011_05_007 elsevier_sciencedirect_doi_10_1016_j_dam_2011_05_007 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-04-01 |
| PublicationDateYYYYMMDD | 2012-04-01 |
| PublicationDate_xml | – month: 04 year: 2012 text: 2012-04-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Discrete Applied Mathematics |
| PublicationYear | 2012 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Cunningham, Edmonds (br000045) 1980; 32 Eppstein, Goodrich, Yu Meng (br000095) 2005; vol. 3843 Brandstädt, Le (br000010) 2006; 98 Corneil, Habib, Lanlignel, Reed, Rotics (br000050) 2000; vol. 1776 Dahlhaus (br000080) 2000; 36 Ma, Spinrad (br000160) 1994; 16 Sumner (br000200) 1973; 6 Brandstädt, Le, Spinrad (br000015) 1999 Bandelt, Mulder (br000020) 1986; 41 Cunningham (br000040) 1982; 3 J. Spinrad, List of open problems Cicerone, Di Stefano (br000035) 1999; 95 Damiand, Habib, Paul (br000085) 2001; 263 Gallai (br000100) 1967; 18 Gavril (br000105) 1974; 16 Charbit, Habib, Limouzy, de Montgolfier, Raffinot, Rao (br000055) 2008; 108 Bouchet (br000025) 1987; 7 Habib, Paul (br000130) 2010; 4 McKee, McMorris (br000150) 1999; vol. 2 Spinrad (br000195) 2003; vol. 19 Crespelle, Paul (br000075) 2006; 154 Hell, Shamir, Sharan (br000125) 2002; 31 Möhring, Radermacher (br000155) 1984; 19 Gavoile, Paul (br000110) 2007; 273 Shamir, Sharan (br000185) 2004; 136 Courcelle (br000065) 2006; 2 Tedder, Corneil (br000205) 2007; vol. 4393 Gioan, Paul (br000115) 2007; vol. 4835 A. Bretscher, LexBFS based recognition algorithms for cographs and related families. Ph.D. Thesis, Department of Computer Science, University of Toronto, 2005. Aho, Hopcroft, Ullman (br000005) 1974 Oum (br000175) 2005; 95 Robertson, Seymour (br000180) 1986; 7 Di Battista, Tamassia (br000090) 1996; 15 Hsu (br000135) 1987; 43 . Corneil, Perl, Stewart (br000060) 1985; 14 Crespelle, Paul (br000070) 2010; 58 Nishimura, Ragde, Thilikos (br000170) 2002; 42 Hammer, Maffray (br000120) 1990; 27 L. Ibarra, Fully dynamic algorithms for chordal graphs, in: Annual ACM-SIAM symposium on Discrete algorithms, SODA, 1999, pp. 923–924. Nakano, Uehara, Uno (br000165) 2007; vol. 4484 J.-M. Lanlignel, Autour de la décomposition en coupes. Ph.D. Thesis, Unicersité deMontpellier 2 (France), 2001. Brandstädt (10.1016/j.dam.2011.05.007_br000010) 2006; 98 Crespelle (10.1016/j.dam.2011.05.007_br000070) 2010; 58 Sumner (10.1016/j.dam.2011.05.007_br000200) 1973; 6 10.1016/j.dam.2011.05.007_br000030 Eppstein (10.1016/j.dam.2011.05.007_br000095) 2005; vol. 3843 Corneil (10.1016/j.dam.2011.05.007_br000060) 1985; 14 Oum (10.1016/j.dam.2011.05.007_br000175) 2005; 95 Habib (10.1016/j.dam.2011.05.007_br000130) 2010; 4 10.1016/j.dam.2011.05.007_br000190 Tedder (10.1016/j.dam.2011.05.007_br000205) 2007; vol. 4393 Brandstädt (10.1016/j.dam.2011.05.007_br000015) 1999 Courcelle (10.1016/j.dam.2011.05.007_br000065) 2006; 2 Bandelt (10.1016/j.dam.2011.05.007_br000020) 1986; 41 Ma (10.1016/j.dam.2011.05.007_br000160) 1994; 16 Gavoile (10.1016/j.dam.2011.05.007_br000110) 2007; 273 Hsu (10.1016/j.dam.2011.05.007_br000135) 1987; 43 Robertson (10.1016/j.dam.2011.05.007_br000180) 1986; 7 Aho (10.1016/j.dam.2011.05.007_br000005) 1974 Gavril (10.1016/j.dam.2011.05.007_br000105) 1974; 16 Nakano (10.1016/j.dam.2011.05.007_br000165) 2007; vol. 4484 Cunningham (10.1016/j.dam.2011.05.007_br000045) 1980; 32 Shamir (10.1016/j.dam.2011.05.007_br000185) 2004; 136 McKee (10.1016/j.dam.2011.05.007_br000150) 1999; vol. 2 Möhring (10.1016/j.dam.2011.05.007_br000155) 1984; 19 Crespelle (10.1016/j.dam.2011.05.007_br000075) 2006; 154 Gallai (10.1016/j.dam.2011.05.007_br000100) 1967; 18 10.1016/j.dam.2011.05.007_br000140 Charbit (10.1016/j.dam.2011.05.007_br000055) 2008; 108 Di Battista (10.1016/j.dam.2011.05.007_br000090) 1996; 15 Cunningham (10.1016/j.dam.2011.05.007_br000040) 1982; 3 Hell (10.1016/j.dam.2011.05.007_br000125) 2002; 31 Spinrad (10.1016/j.dam.2011.05.007_br000195) 2003; vol. 19 Bouchet (10.1016/j.dam.2011.05.007_br000025) 1987; 7 Gioan (10.1016/j.dam.2011.05.007_br000115) 2007; vol. 4835 Dahlhaus (10.1016/j.dam.2011.05.007_br000080) 2000; 36 Cicerone (10.1016/j.dam.2011.05.007_br000035) 1999; 95 Hammer (10.1016/j.dam.2011.05.007_br000120) 1990; 27 Nishimura (10.1016/j.dam.2011.05.007_br000170) 2002; 42 Corneil (10.1016/j.dam.2011.05.007_br000050) 2000; vol. 1776 Damiand (10.1016/j.dam.2011.05.007_br000085) 2001; 263 10.1016/j.dam.2011.05.007_br000145 |
| References_xml | – volume: 32 start-page: 734 year: 1980 end-page: 765 ident: br000045 article-title: A combinatorial decomposition theory publication-title: Canadian Journal of Mathematics – volume: 95 start-page: 197 year: 1999 end-page: 216 ident: br000035 article-title: Graph classes between parity and distance-hereditary graphs publication-title: Discrete Applied Mathematics – volume: 16 start-page: 145 year: 1994 end-page: 160 ident: br000160 article-title: An publication-title: Journal of Algorithms – volume: 2 start-page: 1 year: 2006 end-page: 46 ident: br000065 article-title: The monadic second-order logic of graphs publication-title: Logical Methods in Computer Science – volume: 41 start-page: 182 year: 1986 end-page: 208 ident: br000020 article-title: Distance hereditary graphs publication-title: Journal of Combinatorial Theory Series B – volume: 19 start-page: 257 year: 1984 end-page: 356 ident: br000155 article-title: Substitution decomposition for discrete structures and connections with combinatorial optimization publication-title: Annals of Discrete Mathematics – volume: vol. 4393 start-page: 344 year: 2007 end-page: 355 ident: br000205 article-title: An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs publication-title: Annual Symposium on Theoretical Aspects of Computer Science, STACS – volume: 18 start-page: 25 year: 1967 end-page: 66 ident: br000100 article-title: Transitiv orientierbare graphen publication-title: Acta Mathematica Acad. Sci. Hungar. – reference: A. Bretscher, LexBFS based recognition algorithms for cographs and related families. Ph.D. Thesis, Department of Computer Science, University of Toronto, 2005. – volume: 58 start-page: 405 year: 2010 end-page: 432 ident: br000070 article-title: Fully dynamic algorithm for modular decomposition and recognition of permutation graphs publication-title: Algorithmica – volume: 95 start-page: 79 year: 2005 end-page: 100 ident: br000175 article-title: Rank-width and vertex-minors publication-title: Journal of Combinatorial Theory Series B – reference: J.-M. Lanlignel, Autour de la décomposition en coupes. Ph.D. Thesis, Unicersité deMontpellier 2 (France), 2001. – volume: 14 start-page: 926 year: 1985 end-page: 934 ident: br000060 article-title: A linear time recognition algorithm for cographs publication-title: SIAM Journal on Computing – volume: 42 start-page: 69 year: 2002 end-page: 108 ident: br000170 article-title: On graph powers for leaf-labeled trees publication-title: Journal of Algorithms – reference: L. Ibarra, Fully dynamic algorithms for chordal graphs, in: Annual ACM-SIAM symposium on Discrete algorithms, SODA, 1999, pp. 923–924. – volume: vol. 1776 start-page: 126 year: 2000 end-page: 134 ident: br000050 article-title: Polynomial time recognition of clique-width 3 graphs publication-title: Latin American Symposium on Theoretical Informatics (LATIN) – volume: 6 start-page: 281 year: 1973 end-page: 298 ident: br000200 article-title: Graphs indecomposable with respect to the publication-title: Discrete Mathematics – volume: 27 start-page: 85 year: 1990 end-page: 99 ident: br000120 article-title: Completely separable graphs publication-title: Discrete Applied Mathematics – volume: 154 start-page: 1722 year: 2006 end-page: 1741 ident: br000075 article-title: Fully dynamic recognition algorithm and certificate for directed cographs publication-title: Discrete Applied Mathematics – volume: 263 start-page: 99 year: 2001 end-page: 111 ident: br000085 article-title: A simple paradigm for graph recognition: application to cographs and distance hereditary graphs publication-title: Theoretical Computer Science – volume: 15 start-page: 302 year: 1996 end-page: 318 ident: br000090 article-title: On-line maintanance of triconnected components with spqr-trees publication-title: Algorithmica – volume: 7 start-page: 309 year: 1986 end-page: 322 ident: br000180 article-title: Graph minors II: algorithmic aspects of tree-width publication-title: Journal of Algorithms – volume: 108 start-page: 186 year: 2008 end-page: 191 ident: br000055 article-title: A note on computing set overlap classes publication-title: Information Processing Letters – volume: 98 start-page: 133 year: 2006 end-page: 138 ident: br000010 article-title: Structure and linear time recognition of 3-leaf powers publication-title: Information Processing Letters – volume: 43 start-page: 70 year: 1987 end-page: 94 ident: br000135 article-title: Decomposition of perfect graphs publication-title: Journal of Combinatorial Theory Series B – volume: vol. 3843 start-page: 165 year: 2005 end-page: 176 ident: br000095 article-title: Delta-confluent drawings publication-title: International Symposium on Graph Drawing (GD) – volume: 4 start-page: 41 year: 2010 end-page: 59 ident: br000130 article-title: A survey on algorithmic aspects of modular decomposition publication-title: Computer Science Review – volume: 31 start-page: 289 year: 2002 end-page: 305 ident: br000125 article-title: A fully dynamic algorithm for recognizing and representing proper interval graphs publication-title: SIAM Journal on Computing – year: 1999 ident: br000015 article-title: Graph classes: a survey publication-title: SIAM Monographs on Discrete Mathematics and Applications – reference: . – volume: 136 start-page: 329 year: 2004 end-page: 340 ident: br000185 article-title: A fully dynamic algorithm for modular decomposition and recognition of cographs publication-title: Discrete Applied Mathematics – reference: J. Spinrad, List of open problems: – volume: vol. 4484 start-page: 115 year: 2007 end-page: 127 ident: br000165 article-title: A new approcah to graph recognition and application to distance hereditary graphs publication-title: International Conference on Theory and Applications of Models of Computation (TAMC) – volume: vol. 19 year: 2003 ident: br000195 article-title: Efficient graph representation publication-title: Fields Institute Monographs – volume: 36 start-page: 205 year: 2000 end-page: 240 ident: br000080 article-title: Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition publication-title: Journal of Algorithms – year: 1974 ident: br000005 article-title: The Design and Analysis of Computer Algorithms – volume: 273 start-page: 115 year: 2007 end-page: 130 ident: br000110 article-title: Distance labeling scheme and split decomposition publication-title: Discrete Mathematics – volume: vol. 2 year: 1999 ident: br000150 article-title: Topics in intersection graph theory publication-title: SIAM Monographs on Discrete Mathematics and Applications – volume: vol. 4835 start-page: 41 year: 2007 end-page: 51 ident: br000115 article-title: Dynamic distance hereditary graphs using split decomposition publication-title: International Symposium on Algorithms and Computation, ISAAC – volume: 3 start-page: 214 year: 1982 end-page: 228 ident: br000040 article-title: Decomposition of directed graphs publication-title: SIAM Journal on Algebraic Discrete Methods – volume: 16 start-page: 47 year: 1974 end-page: 56 ident: br000105 article-title: The intersection graphs of a path in a tree are exactly the chordal graphs publication-title: Journal of Combinatorial Theory – volume: 7 start-page: 243 year: 1987 end-page: 254 ident: br000025 article-title: Reducing prime graphs and recognizing circle graphs publication-title: Combinatorica – volume: 18 start-page: 25 year: 1967 ident: 10.1016/j.dam.2011.05.007_br000100 article-title: Transitiv orientierbare graphen publication-title: Acta Mathematica Acad. Sci. Hungar. doi: 10.1007/BF02020961 – volume: 31 start-page: 289 issue: 1 year: 2002 ident: 10.1016/j.dam.2011.05.007_br000125 article-title: A fully dynamic algorithm for recognizing and representing proper interval graphs publication-title: SIAM Journal on Computing doi: 10.1137/S0097539700372216 – volume: 3 start-page: 214 year: 1982 ident: 10.1016/j.dam.2011.05.007_br000040 article-title: Decomposition of directed graphs publication-title: SIAM Journal on Algebraic Discrete Methods doi: 10.1137/0603021 – volume: 15 start-page: 302 issue: 4 year: 1996 ident: 10.1016/j.dam.2011.05.007_br000090 article-title: On-line maintanance of triconnected components with spqr-trees publication-title: Algorithmica doi: 10.1007/s004539900017 – volume: 7 start-page: 309 year: 1986 ident: 10.1016/j.dam.2011.05.007_br000180 article-title: Graph minors II: algorithmic aspects of tree-width publication-title: Journal of Algorithms doi: 10.1016/0196-6774(86)90023-4 – volume: 7 start-page: 243 year: 1987 ident: 10.1016/j.dam.2011.05.007_br000025 article-title: Reducing prime graphs and recognizing circle graphs publication-title: Combinatorica doi: 10.1007/BF02579301 – volume: 14 start-page: 926 issue: 4 year: 1985 ident: 10.1016/j.dam.2011.05.007_br000060 article-title: A linear time recognition algorithm for cographs publication-title: SIAM Journal on Computing doi: 10.1137/0214065 – volume: 98 start-page: 133 issue: 4 year: 2006 ident: 10.1016/j.dam.2011.05.007_br000010 article-title: Structure and linear time recognition of 3-leaf powers publication-title: Information Processing Letters doi: 10.1016/j.ipl.2006.01.004 – volume: 58 start-page: 405 issue: 2 year: 2010 ident: 10.1016/j.dam.2011.05.007_br000070 article-title: Fully dynamic algorithm for modular decomposition and recognition of permutation graphs publication-title: Algorithmica doi: 10.1007/s00453-008-9273-0 – volume: 2 start-page: 1 issue: 2 year: 2006 ident: 10.1016/j.dam.2011.05.007_br000065 article-title: The monadic second-order logic of graphs xvi: canonical graph decomposition publication-title: Logical Methods in Computer Science doi: 10.2168/LMCS-2(2:2)2006 – volume: 263 start-page: 99 year: 2001 ident: 10.1016/j.dam.2011.05.007_br000085 article-title: A simple paradigm for graph recognition: application to cographs and distance hereditary graphs publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(00)00234-6 – year: 1974 ident: 10.1016/j.dam.2011.05.007_br000005 – volume: 43 start-page: 70 year: 1987 ident: 10.1016/j.dam.2011.05.007_br000135 article-title: Decomposition of perfect graphs publication-title: Journal of Combinatorial Theory Series B doi: 10.1016/0095-8956(87)90031-1 – volume: 41 start-page: 182 year: 1986 ident: 10.1016/j.dam.2011.05.007_br000020 article-title: Distance hereditary graphs publication-title: Journal of Combinatorial Theory Series B doi: 10.1016/0095-8956(86)90043-2 – volume: 108 start-page: 186 issue: 4 year: 2008 ident: 10.1016/j.dam.2011.05.007_br000055 article-title: A note on computing set overlap classes publication-title: Information Processing Letters doi: 10.1016/j.ipl.2008.05.005 – volume: 16 start-page: 145 year: 1994 ident: 10.1016/j.dam.2011.05.007_br000160 article-title: An O(n2) algorithm for undirected split decomposition publication-title: Journal of Algorithms doi: 10.1006/jagm.1994.1007 – volume: vol. 19 year: 2003 ident: 10.1016/j.dam.2011.05.007_br000195 article-title: Efficient graph representation – volume: 95 start-page: 197 year: 1999 ident: 10.1016/j.dam.2011.05.007_br000035 article-title: Graph classes between parity and distance-hereditary graphs publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(99)00075-X – volume: 27 start-page: 85 year: 1990 ident: 10.1016/j.dam.2011.05.007_br000120 article-title: Completely separable graphs publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(90)90131-U – ident: 10.1016/j.dam.2011.05.007_br000140 – volume: 19 start-page: 257 year: 1984 ident: 10.1016/j.dam.2011.05.007_br000155 article-title: Substitution decomposition for discrete structures and connections with combinatorial optimization publication-title: Annals of Discrete Mathematics – volume: 95 start-page: 79 year: 2005 ident: 10.1016/j.dam.2011.05.007_br000175 article-title: Rank-width and vertex-minors publication-title: Journal of Combinatorial Theory Series B doi: 10.1016/j.jctb.2005.03.003 – volume: vol. 3843 start-page: 165 year: 2005 ident: 10.1016/j.dam.2011.05.007_br000095 article-title: Delta-confluent drawings – ident: 10.1016/j.dam.2011.05.007_br000190 – year: 1999 ident: 10.1016/j.dam.2011.05.007_br000015 article-title: Graph classes: a survey doi: 10.1137/1.9780898719796 – volume: 32 start-page: 734 issue: 3 year: 1980 ident: 10.1016/j.dam.2011.05.007_br000045 article-title: A combinatorial decomposition theory publication-title: Canadian Journal of Mathematics doi: 10.4153/CJM-1980-057-7 – volume: vol. 4484 start-page: 115 year: 2007 ident: 10.1016/j.dam.2011.05.007_br000165 article-title: A new approcah to graph recognition and application to distance hereditary graphs – volume: 6 start-page: 281 year: 1973 ident: 10.1016/j.dam.2011.05.007_br000200 article-title: Graphs indecomposable with respect to the x-join publication-title: Discrete Mathematics doi: 10.1016/0012-365X(73)90100-3 – volume: vol. 4835 start-page: 41 year: 2007 ident: 10.1016/j.dam.2011.05.007_br000115 article-title: Dynamic distance hereditary graphs using split decomposition – volume: vol. 4393 start-page: 344 year: 2007 ident: 10.1016/j.dam.2011.05.007_br000205 article-title: An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs – volume: 36 start-page: 205 issue: 2 year: 2000 ident: 10.1016/j.dam.2011.05.007_br000080 article-title: Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition publication-title: Journal of Algorithms doi: 10.1006/jagm.2000.1090 – volume: vol. 1776 start-page: 126 year: 2000 ident: 10.1016/j.dam.2011.05.007_br000050 article-title: Polynomial time recognition of clique-width 3 graphs – volume: 42 start-page: 69 issue: 1 year: 2002 ident: 10.1016/j.dam.2011.05.007_br000170 article-title: On graph powers for leaf-labeled trees publication-title: Journal of Algorithms doi: 10.1006/jagm.2001.1195 – volume: vol. 2 year: 1999 ident: 10.1016/j.dam.2011.05.007_br000150 article-title: Topics in intersection graph theory – ident: 10.1016/j.dam.2011.05.007_br000030 – volume: 136 start-page: 329 issue: 2–3 year: 2004 ident: 10.1016/j.dam.2011.05.007_br000185 article-title: A fully dynamic algorithm for modular decomposition and recognition of cographs publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(03)00448-7 – volume: 16 start-page: 47 year: 1974 ident: 10.1016/j.dam.2011.05.007_br000105 article-title: The intersection graphs of a path in a tree are exactly the chordal graphs publication-title: Journal of Combinatorial Theory doi: 10.1016/0095-8956(74)90094-X – ident: 10.1016/j.dam.2011.05.007_br000145 – volume: 4 start-page: 41 issue: 1 year: 2010 ident: 10.1016/j.dam.2011.05.007_br000130 article-title: A survey on algorithmic aspects of modular decomposition publication-title: Computer Science Review doi: 10.1016/j.cosrev.2010.01.001 – volume: 154 start-page: 1722 year: 2006 ident: 10.1016/j.dam.2011.05.007_br000075 article-title: Fully dynamic recognition algorithm and certificate for directed cographs publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2006.03.005 – volume: 273 start-page: 115 year: 2007 ident: 10.1016/j.dam.2011.05.007_br000110 article-title: Distance labeling scheme and split decomposition publication-title: Discrete Mathematics doi: 10.1016/S0012-365X(03)00232-2 |
| SSID | ssj0001218 ssj0000186 ssj0006644 |
| Score | 2.186109 |
| Snippet | In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs,... |
| SourceID | hal proquest crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 708 |
| SubjectTerms | Algorithms Character recognition Combinatorial analysis Computer Science Decomposition Discrete Mathematics Distance hereditary graphs Dynamics Fully dynamic algorithms Graphs Mathematical models Split decomposition Trees |
| Title | Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs |
| URI | https://dx.doi.org/10.1016/j.dam.2011.05.007 https://www.proquest.com/docview/1019652026 https://hal-lirmm.ccsd.cnrs.fr/lirmm-00783420 |
| Volume | 160 |
| WOSCitedRecordID | wos000302981900004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6771 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001218 issn: 0166-218X databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwGLXKxsN4QFxFuclIe6KKlDp2bPNWjcJAMCFtSH2L4thhndp06k1D4lfwi_l8SZquYgIkXqIqcVw359Q--fz5GKFDxjTVhtFICWMiSk0R5VTyyOSklGlhtCTKbTbBT07EaCS_dDo_67Uw6wmvKnF1JS__K9RwDsC2S2f_Au6mUjgBnwF0OALscPwj4E9BVi572thk8ZCR5WYInDV1BKDbUL22GeY-He6osWwOKzJdaRuW_97Tfr_6Xj75NpuPl-fevQH0Kkh2ezl8iVt-5epftMXu2zH0SSDKG6n7ufGIbZT8-_HMh2CHbupoM6O1mmx7H7TDEzbPg7bDE7vrZnwYM00jEBcjPwr5rldwEqXcb8jS9M1-s4FAwnZPy2PRGrS5d9PYGQ98aOICmjcNdq02hMY3g1-Tknhq22SbZD30-kLCsL5POJPQU-4PPgxHH1umZNZx76AO421mrUC90eAl739dPYvu8gmvNeF3OujWuU3IvaYLnNg5u4fuhrcUPPDsuo86pnqA7rTge4h-OJ7hLZ5hYA7e5hl2PHuDd1jmyjqW4cAyvGEZBpbhwDLcZpmvffEIfX03PDs6jsJWHlGRpOky0tKAGmNxwYgoyz7jpBQ2QbI0hJWG5iZRBYy6LCkEp0Qrk6tUKniccL4slEoeo71qVpknCGslEqFSnisV00KLPKel0jKmmsLbjuBdFNcPNiuCz73dbmWS1QmNFxlgkVkssphlgEUXvW5uufQmLzcVpjVaWVCpXn1mQLqbbjsEZJvqrav78eBTNhnPp1N7XSSUxOt-F72qoc-go7ezd3llZquFrVamjMQkffpvLXiGDjZ_0OdobzlfmRfodrFejhfzl4HlvwA159LI |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Split+decomposition+and+graph-labelled+trees%3A+Characterizations+and+fully+dynamic+algorithms+for+totally+decomposable+graphs&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Gioan%2C+Emeric&rft.au=Paul%2C+Christophe&rft.date=2012-04-01&rft.pub=Elsevier+B.V&rft.issn=0166-218X&rft.eissn=1872-6771&rft.volume=160&rft.issue=6&rft.spage=708&rft.epage=733&rft_id=info:doi/10.1016%2Fj.dam.2011.05.007&rft.externalDocID=S0166218X11001892 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon |