Maximum covering with D cliques
Identifieur interne : 001085 ( Istex/Corpus ); précédent : 001084; suivant : 001086Maximum covering with D cliques
Auteurs : Klaus Jansen ; Petra Scheffler ; Gerhard J. WoegingerSource :
- 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
Links to Exploration step
ISTEX:715DA59B18382A8CD5A6A2424E5D28B8733FAD9FLe 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>
<affiliation><mods:affiliation>Fachbereich Mathematik und Informatik, Universität Trier, Postfach 3825, D-W-5500, Trier, Germany</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Scheffler, Petra" sort="Scheffler, Petra" uniqKey="Scheffler P" first="Petra" last="Scheffler">Petra Scheffler</name>
<affiliation><mods:affiliation>FB Mathematik, MA 6-1, TU Berlin, Straße des 17. Juni 136, D-W-1000, Berlin 12, Germany</mods:affiliation>
</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><mods:affiliation>Institut für Informationsverarbeitung, TU Graz, Klosterwiesgasse 32, A-8010, Graz, Austria</mods:affiliation>
</affiliation>
</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>
</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><mods:affiliation>Fachbereich Mathematik und Informatik, Universität Trier, Postfach 3825, D-W-5500, Trier, Germany</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Scheffler, Petra" sort="Scheffler, Petra" uniqKey="Scheffler P" first="Petra" last="Scheffler">Petra Scheffler</name>
<affiliation><mods:affiliation>FB Mathematik, MA 6-1, TU Berlin, Straße des 17. Juni 136, D-W-1000, Berlin 12, Germany</mods:affiliation>
</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><mods:affiliation>Institut für Informationsverarbeitung, TU Graz, Klosterwiesgasse 32, A-8010, Graz, Austria</mods:affiliation>
</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>
<istex><corpusName>springer</corpusName>
<author><json:item><name>Klaus Jansen</name>
<affiliations><json:string>Fachbereich Mathematik und Informatik, Universität Trier, Postfach 3825, D-W-5500, Trier, Germany</json:string>
</affiliations>
</json:item>
<json:item><name>Petra Scheffler</name>
<affiliations><json:string>FB Mathematik, MA 6-1, TU Berlin, Straße des 17. Juni 136, D-W-1000, Berlin 12, Germany</json:string>
</affiliations>
</json:item>
<json:item><name>Gerhard J. Woeginger</name>
<affiliations><json:string>Institut für Informationsverarbeitung, TU Graz, Klosterwiesgasse 32, A-8010, Graz, Austria</json:string>
</affiliations>
</json:item>
</author>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>ReviewPaper</json:string>
</originalGenre>
<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.</abstract>
<qualityIndicators><score>5.912</score>
<pdfVersion>1.3</pdfVersion>
<pdfPageSize>439.28 x 666 pts</pdfPageSize>
<refBibsNative>false</refBibsNative>
<keywordCount>0</keywordCount>
<abstractCharCount>482</abstractCharCount>
<pdfWordCount>5076</pdfWordCount>
<pdfCharCount>22116</pdfCharCount>
<pdfPageCount>10</pdfPageCount>
<abstractWordCount>76</abstractWordCount>
</qualityIndicators>
<title>Maximum covering with D cliques</title>
<chapterId><json:string>27</json:string>
<json:string>Chap27</json:string>
</chapterId>
<refBibs><json:item><author><json:item><name>M,W Bern</name>
</json:item>
<json:item><name>E,L Lawler</name>
</json:item>
<json:item><name>A,L Wong</name>
</json:item>
</author>
<host><volume>8</volume>
<pages><last>235</last>
<first>216</first>
</pages>
<author></author>
<title>J. Algorithms</title>
<publicationDate>1987</publicationDate>
</host>
<title>Linear-time computations of subgraphs of decomposable graphs</title>
<publicationDate>1987</publicationDate>
</json:item>
<json:item><host><author><json:item><name>H,L Bodlaender</name>
</json:item>
</author>
<title>A linear time algorithm for finding tree-decompositions of small treewidth</title>
<publicationDate>1992</publicationDate>
</host>
</json:item>
<json:item><author><json:item><name>S Booth</name>
</json:item>
<json:item><name>S Lueker</name>
</json:item>
</author>
<host><volume>13</volume>
<pages><last>379</last>
<first>335</first>
</pages>
<author></author>
<title>J. Comp Syst. Sc</title>
<publicationDate>1976</publicationDate>
</host>
<title>Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms</title>
<publicationDate>1976</publicationDate>
</json:item>
<json:item><author><json:item><name>D,G Corneil</name>
</json:item>
<json:item><name>Y Perl</name>
</json:item>
<json:item><name>L,K Stewart</name>
</json:item>
</author>
<host><volume>4</volume>
<pages><last>934</last>
<first>926</first>
</pages>
<author></author>
<title>SIAM J. Computing</title>
<publicationDate>1085</publicationDate>
</host>
<title>A linear recognition algorithm for cographs</title>
<publicationDate>1085</publicationDate>
</json:item>
<json:item><host><author><json:item><name>P,F Dietz</name>
</json:item>
</author>
<title>Intersection graph algorithms</title>
<publicationDate>1984</publicationDate>
</host>
</json:item>
<json:item><author><json:item><name>A Frank</name>
</json:item>
</author>
<host><volume>29</volume>
<pages><last>184</last>
<first>176</first>
</pages>
<author></author>
<title>J. Combinatorial Theory (B)</title>
<publicationDate>1980</publicationDate>
</host>
<title>On chain and antichaln families of a partially ordered set</title>
<publicationDate>1980</publicationDate>
</json:item>
<json:item><host><author><json:item><name>M,R Garey</name>
</json:item>
<json:item><name>D,S Johnson</name>
</json:item>
</author>
<title>Computers and Intractability: A Guide to the Theory of NP-Completeness</title>
<publicationDate>1979</publicationDate>
</host>
</json:item>
<json:item><author><json:item><name>F Gavril</name>
</json:item>
</author>
<host><volume>17</volume>
<pages><last>470</last>
<first>465</first>
</pages>
<author></author>
<title>Networks</title>
<publicationDate>1987</publicationDate>
</host>
<title>Algorithms for maximum k-colorings and k-coverings of transitive graphs</title>
<publicationDate>1987</publicationDate>
</json:item>
<json:item><author><json:item><name>F Gavril</name>
</json:item>
<json:item><name>M Yannakakis</name>
</json:item>
</author>
<host><volume>24</volume>
<pages><last>137</last>
<first>133</first>
</pages>
<author></author>
<title>Information Processing Letters</title>
<publicationDate>1987</publicationDate>
</host>
<title>The maximum k-colorable subgraph problem for chordal graphs</title>
<publicationDate>1987</publicationDate>
</json:item>
<json:item><host><author><json:item><name>M,C Golumbic</name>
</json:item>
</author>
<title>Algorithmic graph theory and perfect graphs</title>
<publicationDate>1980</publicationDate>
</host>
</json:item>
<json:item><author><json:item><name>D,S Johnson</name>
</json:item>
</author>
<host><volume>6</volume>
<pages><last>451</last>
<first>434</first>
</pages>
<author></author>
<title>J. Algorithms</title>
<publicationDate>1985</publicationDate>
</host>
<title>The NP-completeness column: an ongoing guide</title>
<publicationDate>1985</publicationDate>
</json:item>
<json:item><author><json:item><name>S Micali</name>
</json:item>
<json:item><name>V,V Vazirani</name>
</json:item>
</author>
<host><pages><last>27</last>
<first>17</first>
</pages>
<author></author>
<title>Proc. 21st Ann</title>
<publicationDate>1980</publicationDate>
</host>
<title>An O( ~x/T ~. IEI) algorithm for finding maximum matchings in general graphs</title>
<publicationDate>1980</publicationDate>
</json:item>
<json:item><author><json:item><name>N Robertson</name>
</json:item>
<json:item><name>P Seymour</name>
</json:item>
</author>
<host><volume>7</volume>
<pages><last>322</last>
<first>309</first>
</pages>
<author></author>
<title>J. Algorithms</title>
<publicationDate>1986</publicationDate>
</host>
<title>Graph Minors. II. Algorithmic aspects Of tree-width</title>
<publicationDate>1986</publicationDate>
</json:item>
<json:item><host><author><json:item><name>P Schefller</name>
</json:item>
</author>
<title>Die Baumweite yon Graphen als ein Ma~ ffir die Kompliziertheit algorithmischer Probleme</title>
<publicationDate>1989</publicationDate>
</host>
</json:item>
</refBibs>
<genre><json:string>conference</json:string>
</genre>
<serie><editor><json:item><name>G. Goos</name>
</json:item>
<json:item><name>J. Hartmanis</name>
</json:item>
</editor>
<issn><json:string>0302-9743</json:string>
</issn>
<language><json:string>unknown</json:string>
</language>
<eissn><json:string>1611-3349</json:string>
</eissn>
<title>Lecture Notes in Computer Science</title>
<copyrightDate>1993</copyrightDate>
</serie>
<host><editor><json:item><name>Zoltán Ésik</name>
</json:item>
</editor>
<subject><json:item><value>Computer Science</value>
</json:item>
<json:item><value>Computer Science</value>
</json:item>
<json:item><value>Computation by Abstract Devices</value>
</json:item>
<json:item><value>Algorithm Analysis and Problem Complexity</value>
</json:item>
<json:item><value>Logics and Meanings of Programs</value>
</json:item>
<json:item><value>Mathematical Logic and Formal Languages</value>
</json:item>
<json:item><value>Combinatorics</value>
</json:item>
<json:item><value>Computer Graphics</value>
</json:item>
</subject>
<isbn><json:string>978-3-540-57163-6</json:string>
</isbn>
<language><json:string>unknown</json:string>
</language>
<eissn><json:string>1611-3349</json:string>
</eissn>
<title>Fundamentals of Computation Theory</title>
<bookId><json:string>3540571639</json:string>
</bookId>
<volume>710</volume>
<pages><last>328</last>
<first>319</first>
</pages>
<issn><json:string>0302-9743</json:string>
</issn>
<genre><json:string>book-series</json:string>
</genre>
<eisbn><json:string>978-3-540-47923-9</json:string>
</eisbn>
<copyrightDate>1993</copyrightDate>
<doi><json:string>10.1007/3-540-57163-9</json:string>
</doi>
</host>
<publicationDate>2005</publicationDate>
<copyrightDate>1993</copyrightDate>
<doi><json:string>10.1007/3-540-57163-9_27</json:string>
</doi>
<id>715DA59B18382A8CD5A6A2424E5D28B8733FAD9F</id>
<score>0.30660498</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/document/715DA59B18382A8CD5A6A2424E5D28B8733FAD9F/fulltext/pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/document/715DA59B18382A8CD5A6A2424E5D28B8733FAD9F/fulltext/zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/document/715DA59B18382A8CD5A6A2424E5D28B8733FAD9F/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Maximum covering with D cliques</title>
<respStmt><resp>Références bibliographiques récupérées via GROBID</resp>
<name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name>
</respStmt>
<respStmt><resp>Références bibliographiques récupérées via GROBID</resp>
<name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name>
</respStmt>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<publisher>Springer Berlin Heidelberg</publisher>
<pubPlace>Berlin, Heidelberg</pubPlace>
<availability><p>Springer-Verlag, 1993</p>
</availability>
<date>1993</date>
</publicationStmt>
<sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Maximum covering with D cliques</title>
<author xml:id="author-1"><persName><forename type="first">Klaus</forename>
<surname>Jansen</surname>
</persName>
<affiliation>Fachbereich Mathematik und Informatik, Universität Trier, Postfach 3825, D-W-5500, Trier, Germany</affiliation>
</author>
<author xml:id="author-2"><persName><forename type="first">Petra</forename>
<surname>Scheffler</surname>
</persName>
<affiliation>FB Mathematik, MA 6-1, TU Berlin, Straße des 17. Juni 136, D-W-1000, Berlin 12, Germany</affiliation>
</author>
<author xml:id="author-3"><persName><forename type="first">Gerhard</forename>
<surname>Woeginger</surname>
</persName>
<affiliation>Institut für Informationsverarbeitung, TU Graz, Klosterwiesgasse 32, A-8010, Graz, Austria</affiliation>
</author>
</analytic>
<monogr><title level="m">Fundamentals of Computation Theory</title>
<title level="m" type="sub">9th International Conference, FCT '93 Szeged, Hungary, August 23–27, 1993 Proceedings</title>
<idno type="pISBN">978-3-540-57163-6</idno>
<idno type="eISBN">978-3-540-47923-9</idno>
<idno type="pISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="DOI">10.1007/3-540-57163-9</idno>
<idno type="book-ID">3540571639</idno>
<idno type="book-title-ID">33793</idno>
<idno type="book-volume-number">710</idno>
<idno type="book-chapter-count">40</idno>
<editor><persName><forename type="first">Zoltán</forename>
<surname>Ésik</surname>
</persName>
</editor>
<imprint><publisher>Springer Berlin Heidelberg</publisher>
<pubPlace>Berlin, Heidelberg</pubPlace>
<date type="published" when="2005-05-30"></date>
<biblScope unit="volume">710</biblScope>
<biblScope unit="page" from="319">319</biblScope>
<biblScope unit="page" to="328">328</biblScope>
</imprint>
</monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<editor><persName><forename type="first">G.</forename>
<surname>Goos</surname>
</persName>
</editor>
<editor><persName><forename type="first">J.</forename>
<surname>Hartmanis</surname>
</persName>
</editor>
<biblScope><date>1993</date>
</biblScope>
<idno type="pISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="series-Id">558</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>
</fileDesc>
<profileDesc><creation><date>1993</date>
</creation>
<langUsage><language ident="en">en</language>
</langUsage>
<abstract xml:lang="en"><p>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.</p>
</abstract>
<textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label>
<item><term>Computer Science</term>
</item>
</list>
</keywords>
</textClass>
<textClass><keywords scheme="Book-Subject-Group"><list><label>I</label>
<label>I16013</label>
<label>I16021</label>
<label>I1603X</label>
<label>I16048</label>
<label>M17009</label>
<label>I22013</label>
<item><term>Computer Science</term>
</item>
<item><term>Computation by Abstract Devices</term>
</item>
<item><term>Algorithm Analysis and Problem Complexity</term>
</item>
<item><term>Logics and Meanings of Programs</term>
</item>
<item><term>Mathematical Logic and Formal Languages</term>
</item>
<item><term>Combinatorics</term>
</item>
<item><term>Computer Graphics</term>
</item>
</list>
</keywords>
</textClass>
</profileDesc>
<revisionDesc><change when="2005-05-30">Published</change>
<change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change>
<change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-21">References added</change>
</revisionDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/document/715DA59B18382A8CD5A6A2424E5D28B8733FAD9F/fulltext/txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration>
<istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType>
<istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName>
<PublisherLocation>Berlin, Heidelberg</PublisherLocation>
</PublisherInfo>
<Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID>
<SeriesPrintISSN>0302-9743</SeriesPrintISSN>
<SeriesElectronicISSN>1611-3349</SeriesElectronicISSN>
<SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle>
<SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle>
</SeriesInfo>
<SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName>
<FamilyName>Goos</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName>
<FamilyName>Hartmanis</FamilyName>
</EditorName>
</Editor>
</EditorGroup>
</SeriesHeader>
<Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540571639</BookID>
<BookTitle>Fundamentals of Computation Theory</BookTitle>
<BookSubTitle>9th International Conference, FCT '93 Szeged, Hungary, August 23–27, 1993 Proceedings</BookSubTitle>
<BookVolumeNumber>710</BookVolumeNumber>
<BookDOI>10.1007/3-540-57163-9</BookDOI>
<BookTitleID>33793</BookTitleID>
<BookPrintISBN>978-3-540-57163-6</BookPrintISBN>
<BookElectronicISBN>978-3-540-47923-9</BookElectronicISBN>
<BookChapterCount>40</BookChapterCount>
<BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName>
<CopyrightYear>1993</CopyrightYear>
</BookCopyright>
<BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject>
<BookSubject Code="I16013" Priority="1" Type="Secondary">Computation by Abstract Devices</BookSubject>
<BookSubject Code="I16021" Priority="2" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject>
<BookSubject Code="I1603X" Priority="3" Type="Secondary">Logics and Meanings of Programs</BookSubject>
<BookSubject Code="I16048" Priority="4" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject>
<BookSubject Code="M17009" Priority="5" Type="Secondary">Combinatorics</BookSubject>
<BookSubject Code="I22013" Priority="6" Type="Secondary">Computer Graphics</BookSubject>
<SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection>
</BookSubjectGroup>
</BookInfo>
<BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Zoltán</GivenName>
<FamilyName>Ésik</FamilyName>
</EditorName>
</Editor>
</EditorGroup>
</BookHeader>
<Chapter ID="Chap27" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>27</ChapterID>
<ChapterDOI>10.1007/3-540-57163-9_27</ChapterDOI>
<ChapterSequenceNumber>27</ChapterSequenceNumber>
<ChapterTitle Language="En">Maximum covering with <Emphasis Type="Italic">D</Emphasis>
cliques</ChapterTitle>
<ChapterCategory>Communications</ChapterCategory>
<ChapterFirstPage>319</ChapterFirstPage>
<ChapterLastPage>328</ChapterLastPage>
<ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName>
<CopyrightYear>1993</CopyrightYear>
</ChapterCopyright>
<ChapterHistory><OnlineDate><Year>2005</Year>
<Month>5</Month>
<Day>30</Day>
</OnlineDate>
</ChapterHistory>
<ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant>
<AbstractGrant Grant="OpenAccess"></AbstractGrant>
<BodyPDFGrant Grant="Restricted"></BodyPDFGrant>
<BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant>
<BibliographyGrant Grant="Restricted"></BibliographyGrant>
<ESMGrant Grant="Restricted"></ESMGrant>
</ChapterGrants>
<ChapterContext><SeriesID>558</SeriesID>
<BookID>3540571639</BookID>
<BookTitle>Fundamentals of Computation Theory</BookTitle>
</ChapterContext>
</ChapterInfo>
<ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Klaus</GivenName>
<FamilyName>Jansen</FamilyName>
</AuthorName>
</Author>
<Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Petra</GivenName>
<FamilyName>Scheffler</FamilyName>
</AuthorName>
</Author>
<Author AffiliationIDS="Aff3"><AuthorName DisplayOrder="Western"><GivenName>Gerhard</GivenName>
<GivenName>J.</GivenName>
<FamilyName>Woeginger</FamilyName>
</AuthorName>
</Author>
<Affiliation ID="Aff1"><OrgDivision>Fachbereich Mathematik und Informatik</OrgDivision>
<OrgName>Universität Trier</OrgName>
<OrgAddress><Postbox>Postfach 3825</Postbox>
<Postcode>D-W-5500</Postcode>
<City>Trier</City>
<Country>Germany</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff2"><OrgName>FB Mathematik, MA 6-1, TU Berlin</OrgName>
<OrgAddress><Street>Straße des 17. Juni 136</Street>
<Postcode>D-W-1000</Postcode>
<City>Berlin 12</City>
<Country>Germany</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff3"><OrgName>Institut für Informationsverarbeitung, TU Graz</OrgName>
<OrgAddress><Street>Klosterwiesgasse 32</Street>
<Postcode>A-8010</Postcode>
<City>Graz</City>
<Country>Austria</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>Given a graph <Emphasis Type="Italic">G = (V, E)</Emphasis>
, we consider the problem to find a set of <Emphasis Type="Italic">D</Emphasis>
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 <Emphasis Type="Italic">k</Emphasis>
-trees. In contrast, we show the NP-completeness for undirected path graphs.</Para>
</Abstract>
</ChapterHeader>
<NoBody></NoBody>
</Chapter>
</Book>
</Series>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Maximum covering with D cliques</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA" lang="en"><title>Maximum covering with D cliques</title>
</titleInfo>
<name type="personal"><namePart type="given">Klaus</namePart>
<namePart type="family">Jansen</namePart>
<affiliation>Fachbereich Mathematik und Informatik, Universität Trier, Postfach 3825, D-W-5500, Trier, Germany</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Petra</namePart>
<namePart type="family">Scheffler</namePart>
<affiliation>FB Mathematik, MA 6-1, TU Berlin, Straße des 17. Juni 136, D-W-1000, Berlin 12, Germany</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Gerhard</namePart>
<namePart type="given">J.</namePart>
<namePart type="family">Woeginger</namePart>
<affiliation>Institut für Informationsverarbeitung, TU Graz, Klosterwiesgasse 32, A-8010, Graz, Austria</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre type="conference" displayLabel="ReviewPaper"></genre>
<originInfo><publisher>Springer Berlin Heidelberg</publisher>
<place><placeTerm type="text">Berlin, Heidelberg</placeTerm>
</place>
<dateIssued encoding="w3cdtf">2005-05-30</dateIssued>
<copyrightDate encoding="w3cdtf">1993</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<physicalDescription><internetMediaType>text/html</internetMediaType>
</physicalDescription>
<abstract 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.</abstract>
<relatedItem type="host"><titleInfo><title>Fundamentals of Computation Theory</title>
<subTitle>9th International Conference, FCT '93 Szeged, Hungary, August 23–27, 1993 Proceedings</subTitle>
</titleInfo>
<name type="personal"><namePart type="given">Zoltán</namePart>
<namePart type="family">Ésik</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<genre type="book-series" displayLabel="Proceedings"></genre>
<originInfo><copyrightDate encoding="w3cdtf">1993</copyrightDate>
<issuance>monographic</issuance>
</originInfo>
<subject><genre>Book-Subject-Collection</genre>
<topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic>
</subject>
<subject><genre>Book-Subject-Group</genre>
<topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic>
<topic authority="SpringerSubjectCodes" authorityURI="M17009">Combinatorics</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I22013">Computer Graphics</topic>
</subject>
<identifier type="DOI">10.1007/3-540-57163-9</identifier>
<identifier type="ISBN">978-3-540-57163-6</identifier>
<identifier type="eISBN">978-3-540-47923-9</identifier>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="BookTitleID">33793</identifier>
<identifier type="BookID">3540571639</identifier>
<identifier type="BookChapterCount">40</identifier>
<identifier type="BookVolumeNumber">710</identifier>
<part><date>1993</date>
<detail type="volume"><number>710</number>
<caption>vol.</caption>
</detail>
<extent unit="pages"><start>319</start>
<end>328</end>
</extent>
</part>
<recordInfo><recordOrigin>Springer-Verlag, 1993</recordOrigin>
</recordInfo>
</relatedItem>
<relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title>
</titleInfo>
<name type="personal"><namePart type="given">G.</namePart>
<namePart type="family">Goos</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">J.</namePart>
<namePart type="family">Hartmanis</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<originInfo><copyrightDate encoding="w3cdtf">1993</copyrightDate>
<issuance>serial</issuance>
</originInfo>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="SeriesID">558</identifier>
<recordInfo><recordOrigin>Springer-Verlag, 1993</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">715DA59B18382A8CD5A6A2424E5D28B8733FAD9F</identifier>
<identifier type="DOI">10.1007/3-540-57163-9_27</identifier>
<identifier type="ChapterID">27</identifier>
<identifier type="ChapterID">Chap27</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1993</accessCondition>
<recordInfo><recordContentSource>SPRINGER</recordContentSource>
<recordOrigin>Springer-Verlag, 1993</recordOrigin>
</recordInfo>
</mods>
</metadata>
</istex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001085 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001085 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Rhénanie |area= UnivTrevesV1 |flux= Istex |étape= Corpus |type= RBID |clé= ISTEX:715DA59B18382A8CD5A6A2424E5D28B8733FAD9F |texte= Maximum covering with D cliques }}
![]() | This area was generated with Dilib version V0.6.31. | ![]() |