Maximum covering with D cliques
Identifieur interne : 002C24 ( Main/Exploration ); précédent : 002C23; suivant : 002C25Maximum covering with D cliques
Auteurs : Klaus Jansen [Allemagne] ; Petra Scheffler [Allemagne] ; Gerhard J. Woeginger [Autriche]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1993.
Abstract
Abstract: Given a graph G = (V, E), we consider the problem to find a set of D pairwise disjoint cliques in it with maximum overall number of vertices. We determine the computational complexity of this problem restricted to a variety of different graph classes. We give polynomial time algorithms for the problem restricted to interval graphs, bipartite graphs, cographs, directed path graphs and partial k-trees. In contrast, we show the NP-completeness for undirected path graphs.
Url:
DOI: 10.1007/3-540-57163-9_27
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001085
- to stream Istex, to step Curation: 000F74
- to stream Istex, to step Checkpoint: 001328
- to stream Main, to step Merge: 003175
- to stream Main, to step Curation: 002C24
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Maximum covering with D cliques</title><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name></author><author><name sortKey="Scheffler, Petra" sort="Scheffler, Petra" uniqKey="Scheffler P" first="Petra" last="Scheffler">Petra Scheffler</name></author><author><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:715DA59B18382A8CD5A6A2424E5D28B8733FAD9F</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1007/3-540-57163-9_27</idno><idno type="url">https://api.istex.fr/document/715DA59B18382A8CD5A6A2424E5D28B8733FAD9F/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001085</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001085</idno><idno type="wicri:Area/Istex/Curation">000F74</idno><idno type="wicri:Area/Istex/Checkpoint">001328</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001328</idno><idno type="wicri:doubleKey">0302-9743:1993:Jansen K:maximum:covering:with</idno><idno type="wicri:Area/Main/Merge">003175</idno><idno type="wicri:Area/Main/Curation">002C24</idno><idno type="wicri:Area/Main/Exploration">002C24</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Maximum covering with D cliques</title><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich Mathematik und Informatik, Universität Trier, Postfach 3825, D-W-5500, Trier</wicri:regionArea><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation></author><author><name sortKey="Scheffler, Petra" sort="Scheffler, Petra" uniqKey="Scheffler P" first="Petra" last="Scheffler">Petra Scheffler</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>FB Mathematik, MA 6-1, TU Berlin, Straße des 17. Juni 136, D-W-1000, Berlin 12</wicri:regionArea><placeName><region type="land" nuts="3">Berlin</region><settlement type="city">Berlin</settlement></placeName></affiliation></author><author><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name><affiliation wicri:level="1"><country xml:lang="fr">Autriche</country><wicri:regionArea>Institut für Informationsverarbeitung, TU Graz, Klosterwiesgasse 32, A-8010, Graz</wicri:regionArea><wicri:noRegion>Graz</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1993</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">715DA59B18382A8CD5A6A2424E5D28B8733FAD9F</idno><idno type="DOI">10.1007/3-540-57163-9_27</idno><idno type="ChapterID">27</idno><idno type="ChapterID">Chap27</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Given a graph G = (V, E), we consider the problem to find a set of D pairwise disjoint cliques in it with maximum overall number of vertices. We determine the computational complexity of this problem restricted to a variety of different graph classes. We give polynomial time algorithms for the problem restricted to interval graphs, bipartite graphs, cographs, directed path graphs and partial k-trees. In contrast, we show the NP-completeness for undirected path graphs.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Autriche</li></country><region><li>Berlin</li></region><settlement><li>Berlin</li></settlement></list><tree><country name="Allemagne"><noRegion><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name></noRegion><name sortKey="Scheffler, Petra" sort="Scheffler, Petra" uniqKey="Scheffler P" first="Petra" last="Scheffler">Petra Scheffler</name></country><country name="Autriche"><noRegion><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002C24 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002C24 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:715DA59B18382A8CD5A6A2424E5D28B8733FAD9F
|texte= Maximum covering with D cliques
}}
| This area was generated with Dilib version V0.6.31. |  |