Restrictions of graph partition problems. Part I
Identifieur interne : 001171 ( Istex/Curation ); précédent : 001170; suivant : 001172Restrictions of graph partition problems. Part I
Auteurs : Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne]Source :
- Theoretical Computer Science [ 0304-3975 ] ; 1995.
Abstract
In this paper partition problems into k independent sets or cliques of bounded size k′ are analyzed for several classes of graphs. We prove the computational complexity of both problems restricted to cographs, split graphs, bipartite graphs and interval graphs given general or constant k and k′. It is shown, that the assignment problem for operations in a branching flow graph to processors, each with a limit on the number of executable operations, equals the first problem restricted to cographs. In addition a job-assignment problem given intervals for each job and k machines, each executing at most k′ jobs, equals the first problem restricted to interval graphs. It is shown, that both problem are NP-complete.
Url:
DOI: 10.1016/0304-3975(95)00057-4
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001283
Links to Exploration step
ISTEX:FFD47E67B836DA6CB2B10C89B64E79EC98B9ECCBLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Restrictions of graph partition problems. Part I</title><author><name sortKey="Bodlaender, Hans L" sort="Bodlaender, Hans L" uniqKey="Bodlaender H" first="Hans L." last="Bodlaender">Hans L. Bodlaender</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands</mods:affiliation><country xml:lang="fr">Pays-Bas</country><wicri:regionArea>Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht</wicri:regionArea></affiliation><affiliation><mods:affiliation>1 The work of this author was partially supported by the ESPRIT II Basic Research Actions Program of the EC under contract no. 3075 (project ALCOM).</mods:affiliation><wicri:noCountry code="no comma">1 The work of this author was partially supported by the ESPRIT II Basic Research Actions Program of the EC under contract no. 3075 (project ALCOM).</wicri:noCountry></affiliation></author><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation><mods:affiliation>Corresponding author.</mods:affiliation><wicri:noCountry code="no comma">Corresponding author.</wicri:noCountry></affiliation><affiliation wicri:level="1"><mods:affiliation>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, 54286 Trier, Germany</mods:affiliation><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, 54286 Trier</wicri:regionArea></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:FFD47E67B836DA6CB2B10C89B64E79EC98B9ECCB</idno><date when="1995" year="1995">1995</date><idno type="doi">10.1016/0304-3975(95)00057-4</idno><idno type="url">https://api.istex.fr/document/FFD47E67B836DA6CB2B10C89B64E79EC98B9ECCB/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001283</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001283</idno><idno type="wicri:Area/Istex/Curation">001171</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Restrictions of graph partition problems. Part I</title><author><name sortKey="Bodlaender, Hans L" sort="Bodlaender, Hans L" uniqKey="Bodlaender H" first="Hans L." last="Bodlaender">Hans L. Bodlaender</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands</mods:affiliation><country xml:lang="fr">Pays-Bas</country><wicri:regionArea>Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht</wicri:regionArea></affiliation><affiliation><mods:affiliation>1 The work of this author was partially supported by the ESPRIT II Basic Research Actions Program of the EC under contract no. 3075 (project ALCOM).</mods:affiliation></affiliation></author><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation><mods:affiliation>Corresponding author.</mods:affiliation></affiliation><affiliation wicri:level="1"><mods:affiliation>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, 54286 Trier, Germany</mods:affiliation><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, 54286 Trier</wicri:regionArea></affiliation></author></analytic><monogr></monogr><series><title level="j">Theoretical Computer Science</title><title level="j" type="abbrev">TCS</title><idno type="ISSN">0304-3975</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1995">1995</date><biblScope unit="volume">148</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="93">93</biblScope><biblScope unit="page" to="109">109</biblScope></imprint><idno type="ISSN">0304-3975</idno></series><idno type="istex">FFD47E67B836DA6CB2B10C89B64E79EC98B9ECCB</idno><idno type="DOI">10.1016/0304-3975(95)00057-4</idno><idno type="PII">0304-3975(95)00057-4</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0304-3975</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In this paper partition problems into k independent sets or cliques of bounded size k′ are analyzed for several classes of graphs. We prove the computational complexity of both problems restricted to cographs, split graphs, bipartite graphs and interval graphs given general or constant k and k′. It is shown, that the assignment problem for operations in a branching flow graph to processors, each with a limit on the number of executable operations, equals the first problem restricted to cographs. In addition a job-assignment problem given intervals for each job and k machines, each executing at most k′ jobs, equals the first problem restricted to interval graphs. It is shown, that both problem are NP-complete.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001171 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 001171 | 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= Curation
|type= RBID
|clé= ISTEX:FFD47E67B836DA6CB2B10C89B64E79EC98B9ECCB
|texte= Restrictions of graph partition problems. Part I
}}
| This area was generated with Dilib version V0.6.31. |  |