Efficient and practical algorithms for sequential modular decomposition
Identifieur interne : 000889 ( PascalFrancis/Corpus ); précédent : 000888; suivant : 000890Efficient and practical algorithms for sequential modular decomposition
Auteurs : Elias Dahlhaus ; Jens Gustedt ; Ross M. McconnellSource :
- Journal of algorithms : (Print) [ 0196-6774 ] ; 2001.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
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 practical algorithm with an O(n + ma(m, n)) time bound and a variant with a linear time bound.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
pA |
|
---|
Format Inist (serveur)
NO : | PASCAL 02-0139077 INIST |
---|---|
ET : | Efficient and practical algorithms for sequential modular decomposition |
AU : | DAHLHAUS (Elias); GUSTEDT (Jens); MCCONNELL (Ross M.) |
AF : | Department of Computer Science and Department of Mathematics, University of Cologne/Cologne/Allemagne (1 aut.); LORIA and INRIA Lorraine, campus scientifique, BP 239/54506, Vandœuvre lés Nancy/France (2 aut.); Department of Computer Science and Engineering University of Colorado at Denver/Denver, Colorado 80217-3364/Etats-Unis (3 aut.) |
DT : | Publication en série; Niveau analytique |
SO : | Journal of algorithms : (Print); ISSN 0196-6774; Coden JOALDV; Etats-Unis; Da. 2001; Vol. 41; No. 2; Pp. 360-387; Bibl. 28 ref. |
LA : | Anglais |
EA : | 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 practical algorithm with an O(n + ma(m, n)) time bound and a variant with a linear time bound. |
CC : | 001A02B01C |
FD : | Théorie graphe; Décomposition graphe; Construction modulaire; Algorithme; Extraction séquentielle; Efficacité; Congruence; Sous graphe; Partition; Complexité temps; Borne inférieure; Borne supérieure; Décomposition séquentielle |
ED : | Graph theory; Graph decomposition; Modular construction; Algorithm; Sequential extraction; Efficiency; Congruence; Subgraph; Partition; Time complexity; Lower bound; Upper bound; Sequential decomposition |
SD : | Teoría grafo; Descomposición grafo; Construcción modular; Algoritmo; Extracción secuenciala; Eficacia; Congruencia; Subgrafo; Partición; Complejidad tiempo; Cota inferior; Cota superior |
LO : | INIST-18373.354000094692230110 |
ID : | 02-0139077 |
Links to Exploration step
Pascal:02-0139077Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">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>
<affiliation><inist:fA14 i1="01"><s1>Department of Computer Science and Department of Mathematics, University of Cologne</s1>
<s2>Cologne</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA and INRIA Lorraine, campus scientifique, BP 239</s1>
<s2>54506, Vandœuvre lés Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Mcconnell, Ross M" sort="Mcconnell, Ross M" uniqKey="Mcconnell R" first="Ross M." last="Mcconnell">Ross M. Mcconnell</name>
<affiliation><inist:fA14 i1="03"><s1>Department of Computer Science and Engineering University of Colorado at Denver</s1>
<s2>Denver, Colorado 80217-3364</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">02-0139077</idno>
<date when="2001">2001</date>
<idno type="stanalyst">PASCAL 02-0139077 INIST</idno>
<idno type="RBID">Pascal:02-0139077</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000889</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">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>
<affiliation><inist:fA14 i1="01"><s1>Department of Computer Science and Department of Mathematics, University of Cologne</s1>
<s2>Cologne</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA and INRIA Lorraine, campus scientifique, BP 239</s1>
<s2>54506, Vandœuvre lés Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Mcconnell, Ross M" sort="Mcconnell, Ross M" uniqKey="Mcconnell R" first="Ross M." last="Mcconnell">Ross M. Mcconnell</name>
<affiliation><inist:fA14 i1="03"><s1>Department of Computer Science and Engineering University of Colorado at Denver</s1>
<s2>Denver, Colorado 80217-3364</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Journal of algorithms : (Print)</title>
<title level="j" type="abbreviated">J. algorithms : (Print)</title>
<idno type="ISSN">0196-6774</idno>
<imprint><date when="2001">2001</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Journal of algorithms : (Print)</title>
<title level="j" type="abbreviated">J. algorithms : (Print)</title>
<idno type="ISSN">0196-6774</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term>
<term>Congruence</term>
<term>Efficiency</term>
<term>Graph decomposition</term>
<term>Graph theory</term>
<term>Lower bound</term>
<term>Modular construction</term>
<term>Partition</term>
<term>Sequential decomposition</term>
<term>Sequential extraction</term>
<term>Subgraph</term>
<term>Time complexity</term>
<term>Upper bound</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Théorie graphe</term>
<term>Décomposition graphe</term>
<term>Construction modulaire</term>
<term>Algorithme</term>
<term>Extraction séquentielle</term>
<term>Efficacité</term>
<term>Congruence</term>
<term>Sous graphe</term>
<term>Partition</term>
<term>Complexité temps</term>
<term>Borne inférieure</term>
<term>Borne supérieure</term>
<term>Décomposition séquentielle</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">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 practical algorithm with an O(n + ma(m, n)) time bound and a variant with a linear time bound.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0196-6774</s0>
</fA01>
<fA02 i1="01"><s0>JOALDV</s0>
</fA02>
<fA03 i2="1"><s0>J. algorithms : (Print)</s0>
</fA03>
<fA05><s2>41</s2>
</fA05>
<fA06><s2>2</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Efficient and practical algorithms for sequential modular decomposition</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>DAHLHAUS (Elias)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>GUSTEDT (Jens)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>MCCONNELL (Ross M.)</s1>
</fA11>
<fA14 i1="01"><s1>Department of Computer Science and Department of Mathematics, University of Cologne</s1>
<s2>Cologne</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LORIA and INRIA Lorraine, campus scientifique, BP 239</s1>
<s2>54506, Vandœuvre lés Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>Department of Computer Science and Engineering University of Colorado at Denver</s1>
<s2>Denver, Colorado 80217-3364</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>360-387</s1>
</fA20>
<fA21><s1>2001</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>18373</s2>
<s5>354000094692230110</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2002 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>28 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>02-0139077</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Journal of algorithms : (Print)</s0>
</fA64>
<fA66 i1="01"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>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 practical algorithm with an O(n + ma(m, n)) time bound and a variant with a linear time bound.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001A02B01C</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Théorie graphe</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Graph theory</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Teoría grafo</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Décomposition graphe</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Graph decomposition</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Descomposición grafo</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Construction modulaire</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Modular construction</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Construcción modular</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Algorithme</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Algorithm</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Algoritmo</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Extraction séquentielle</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Sequential extraction</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Extracción secuenciala</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Efficacité</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Efficiency</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Eficacia</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Congruence</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Congruence</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Congruencia</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Sous graphe</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Subgraph</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Subgrafo</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Partition</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Partition</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Partición</s0>
<s5>09</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Complexité temps</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Time complexity</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Complejidad tiempo</s0>
<s5>10</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Borne inférieure</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Lower bound</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Cota inferior</s0>
<s5>11</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Borne supérieure</s0>
<s5>12</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Upper bound</s0>
<s5>12</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA"><s0>Cota superior</s0>
<s5>12</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Décomposition séquentielle</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Sequential decomposition</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>077</s1>
</fN21>
</pA>
</standard>
<server><NO>PASCAL 02-0139077 INIST</NO>
<ET>Efficient and practical algorithms for sequential modular decomposition</ET>
<AU>DAHLHAUS (Elias); GUSTEDT (Jens); MCCONNELL (Ross M.)</AU>
<AF>Department of Computer Science and Department of Mathematics, University of Cologne/Cologne/Allemagne (1 aut.); LORIA and INRIA Lorraine, campus scientifique, BP 239/54506, Vandœuvre lés Nancy/France (2 aut.); Department of Computer Science and Engineering University of Colorado at Denver/Denver, Colorado 80217-3364/Etats-Unis (3 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Journal of algorithms : (Print); ISSN 0196-6774; Coden JOALDV; Etats-Unis; Da. 2001; Vol. 41; No. 2; Pp. 360-387; Bibl. 28 ref.</SO>
<LA>Anglais</LA>
<EA>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 practical algorithm with an O(n + ma(m, n)) time bound and a variant with a linear time bound.</EA>
<CC>001A02B01C</CC>
<FD>Théorie graphe; Décomposition graphe; Construction modulaire; Algorithme; Extraction séquentielle; Efficacité; Congruence; Sous graphe; Partition; Complexité temps; Borne inférieure; Borne supérieure; Décomposition séquentielle</FD>
<ED>Graph theory; Graph decomposition; Modular construction; Algorithm; Sequential extraction; Efficiency; Congruence; Subgraph; Partition; Time complexity; Lower bound; Upper bound; Sequential decomposition</ED>
<SD>Teoría grafo; Descomposición grafo; Construcción modular; Algoritmo; Extracción secuenciala; Eficacia; Congruencia; Subgrafo; Partición; Complejidad tiempo; Cota inferior; Cota superior</SD>
<LO>INIST-18373.354000094692230110</LO>
<ID>02-0139077</ID>
</server>
</inist>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000889 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000889 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= PascalFrancis |étape= Corpus |type= RBID |clé= Pascal:02-0139077 |texte= Efficient and practical algorithms for sequential modular decomposition }}
This area was generated with Dilib version V0.6.33. |