Efficient and Practical Algorithms for Sequential Modular Decomposition
Identifieur interne : 001E91 ( Hal/Corpus ); précédent : 001E90; suivant : 001E92Efficient and Practical Algorithms for Sequential Modular Decomposition
Auteurs : Elias Dahlhaus ; Jens Gustedt ; Ross M. McconnellSource :
- Journal of Algorithms in Cognition, Informatics and Logic [ 0196-6774 ] ; 2001.
Descripteurs français
Abstract
A module of an undirected graph G=(V,E) is a set X of vertices that have the same set of neighbors in V \ X. The modular decomposition is a unique decomposition of the vertices into nested modules. We give a simpler approach to sequential linear-time modular decomposition. || Un module d'un graphe non-orienté G=(V,E) est un ensemble X de sommets qui partage le même ensemble de voisins en V \ X. La décomposition modulaire est une décomposition unique des sommets en modules emboîtés. Nous donnons une approche simplifiée à la
Url:
Links to Exploration step
Hal:inria-00100822Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Efficient and Practical Algorithms for Sequential Modular Decomposition</title>
<author><name sortKey="Dahlhaus, Elias" sort="Dahlhaus, Elias" uniqKey="Dahlhaus E" first="Elias" last="Dahlhaus">Elias Dahlhaus</name>
</author>
<author><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-2363" status="OLD"><idno type="RNSR">199621458W</idno>
<orgName>Software Tools for Telecommunications and Distributed Systems</orgName>
<orgName type="acronym">RESEDAS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/resedas</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Mcconnell, Ross M" sort="Mcconnell, Ross M" uniqKey="Mcconnell R" first="Ross M." last="Mcconnell">Ross M. Mcconnell</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00100822</idno>
<idno type="halId">inria-00100822</idno>
<idno type="halUri">https://hal.inria.fr/inria-00100822</idno>
<idno type="url">https://hal.inria.fr/inria-00100822</idno>
<date when="2001">2001</date>
<idno type="wicri:Area/Hal/Corpus">001E91</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Efficient and Practical Algorithms for Sequential Modular Decomposition</title>
<author><name sortKey="Dahlhaus, Elias" sort="Dahlhaus, Elias" uniqKey="Dahlhaus E" first="Elias" last="Dahlhaus">Elias Dahlhaus</name>
</author>
<author><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-2363" status="OLD"><idno type="RNSR">199621458W</idno>
<orgName>Software Tools for Telecommunications and Distributed Systems</orgName>
<orgName type="acronym">RESEDAS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/resedas</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Mcconnell, Ross M" sort="Mcconnell, Ross M" uniqKey="Mcconnell R" first="Ross M." last="Mcconnell">Ross M. Mcconnell</name>
</author>
</analytic>
<series><title level="j">Journal of Algorithms in Cognition, Informatics and Logic</title>
<idno type="ISSN">0196-6774</idno>
<imprint><date type="datePub">2001</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="fr"><term>algorithmes linéaires</term>
<term>décomposition modulaire</term>
<term>linear time algorithms</term>
<term>modular decomposition</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="fr">A module of an undirected graph G=(V,E) is a set X of vertices that have the same set of neighbors in V \ X. The modular decomposition is a unique decomposition of the vertices into nested modules. We give a simpler approach to sequential linear-time modular decomposition. || Un module d'un graphe non-orienté G=(V,E) est un ensemble X de sommets qui partage le même ensemble de voisins en V \ X. La décomposition modulaire est une décomposition unique des sommets en modules emboîtés. Nous donnons une approche simplifiée à la</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Efficient and Practical Algorithms for Sequential Modular Decomposition</title>
<author role="aut"><persName><forename type="first">Elias</forename>
<surname>Dahlhaus</surname>
</persName>
<email></email>
<idno type="halauthor">132045</idno>
<orgName ref="#struct-365190"></orgName>
</author>
<author role="aut"><persName><forename type="first">Jens</forename>
<surname>Gustedt</surname>
</persName>
<email>Jens.Gustedt@loria.fr</email>
<idno type="idhal">jens-gustedt</idno>
<idno type="halauthor">129964</idno>
<idno type="ORCID">http://orcid.org/0000-0003-0779-1944</idno>
<orgName ref="#struct-300009"></orgName>
<affiliation ref="#struct-2363"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Ross M.</forename>
<surname>Mcconnell</surname>
</persName>
<email></email>
<idno type="halauthor">132046</idno>
<orgName ref="#struct-365191"></orgName>
</author>
<editor role="depositor"><persName><forename>Jens</forename>
<surname>Gustedt</surname>
</persName>
<email>Jens.Gustedt@dmtcs.org</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2006-09-26 14:51:54</date>
<date type="whenModified">2016-05-19 01:09:08</date>
<date type="whenReleased">2006-09-28 15:22:47</date>
<date type="whenProduced">2001</date>
</edition>
<respStmt><resp>contributor</resp>
<name key="105206"><persName><forename>Jens</forename>
<surname>Gustedt</surname>
</persName>
<email>Jens.Gustedt@dmtcs.org</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">inria-00100822</idno>
<idno type="halUri">https://hal.inria.fr/inria-00100822</idno>
<idno type="halBibtex">dahlhaus:inria-00100822</idno>
<idno type="halRefHtml">Journal of Algorithms in Cognition, Informatics and Logic, Elsevier, 2001, 41 (2), pp.360-387</idno>
<idno type="halRef">Journal of Algorithms in Cognition, Informatics and Logic, Elsevier, 2001, 41 (2), pp.360-387</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
</seriesStmt>
<notesStmt><note type="commentary">Article dans revue scientifique avec comité de lecture.</note>
<note type="audience" n="1">Not set</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Efficient and Practical Algorithms for Sequential Modular Decomposition</title>
<author role="aut"><persName><forename type="first">Elias</forename>
<surname>Dahlhaus</surname>
</persName>
<idno type="halAuthorId">132045</idno>
<orgName ref="#struct-365190"></orgName>
</author>
<author role="aut"><persName><forename type="first">Jens</forename>
<surname>Gustedt</surname>
</persName>
<email>Jens.Gustedt@loria.fr</email>
<idno type="idHal">jens-gustedt</idno>
<idno type="halAuthorId">129964</idno>
<idno type="ORCID">http://orcid.org/0000-0003-0779-1944</idno>
<orgName ref="#struct-300009"></orgName>
<affiliation ref="#struct-2363"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Ross M.</forename>
<surname>Mcconnell</surname>
</persName>
<idno type="halAuthorId">132046</idno>
<orgName ref="#struct-365191"></orgName>
</author>
</analytic>
<monogr><idno type="localRef">A01-R-002 || dahlhaus01a</idno>
<idno type="halJournalId" status="VALID">15052</idno>
<idno type="issn">0196-6774</idno>
<idno type="eissn">1090-2678</idno>
<title level="j">Journal of Algorithms in Cognition, Informatics and Logic</title>
<imprint><publisher>Elsevier</publisher>
<biblScope unit="volume">41</biblScope>
<biblScope unit="issue">2</biblScope>
<biblScope unit="pp">360-387</biblScope>
<date type="datePub">2001</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="fr">décomposition modulaire</term>
<term xml:lang="fr">linear time algorithms</term>
<term xml:lang="fr">modular decomposition</term>
<term xml:lang="fr">algorithmes linéaires</term>
</keywords>
<classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="fr">A module of an undirected graph G=(V,E) is a set X of vertices that have the same set of neighbors in V \ X. The modular decomposition is a unique decomposition of the vertices into nested modules. We give a simpler approach to sequential linear-time modular decomposition. || Un module d'un graphe non-orienté G=(V,E) est un ensemble X de sommets qui partage le même ensemble de voisins en V \ X. La décomposition modulaire est une décomposition unique des sommets en modules emboîtés. Nous donnons une approche simplifiée à la</abstract>
</profileDesc>
</hal>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001E91 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 001E91 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Hal |étape= Corpus |type= RBID |clé= Hal:inria-00100822 |texte= Efficient and Practical Algorithms for Sequential Modular Decomposition }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |