Graph theoretic concepts in computer science: 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005 ; revised selected papers
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2005
|
| Schriftenreihe: | Lecture notes in computer science
3787 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIV, 470 S. Ill., graph. Darst. |
| ISBN: | 3540310002 9783540310006 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV021292685 | ||
| 003 | DE-604 | ||
| 005 | 20141118 | ||
| 007 | t| | ||
| 008 | 060116s2005 xx ad|| |||| 00||| eng d | ||
| 020 | |a 3540310002 |9 3-540-31000-2 | ||
| 020 | |a 9783540310006 |9 978-3-540-31000-6 | ||
| 035 | |a (OCoLC)63175817 | ||
| 035 | |a (DE-599)BVBBV021292685 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-91G |a DE-11 |a DE-706 |a DE-83 | ||
| 050 | 0 | |a QA166 | |
| 082 | 0 | |a 004.015115 |2 22 | |
| 084 | |a DAT 537f |2 stub | ||
| 084 | |a MAT 055f |2 stub | ||
| 245 | 1 | 0 | |a Graph theoretic concepts in computer science |b 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005 ; revised selected papers |c Dieter Kratsch (ed.) |
| 246 | 1 | 3 | |a Graph-theoretic concepts in computer science |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2005 | |
| 300 | |a XIV, 470 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 3787 | |
| 650 | 7 | |a Graphentheorie |2 swd | |
| 650 | 4 | |a Graphes, Théorie des - Congrès | |
| 650 | 4 | |a Informatique - Congrès | |
| 650 | 7 | |a Theoretische Informatik |2 swd | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Computer science |v Congresses | |
| 650 | 4 | |a Graph theory |v Congresses | |
| 650 | 4 | |a Graph theory |x Data processing |v Congresses | |
| 651 | 7 | |a Metz <2005> |2 swd | |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 700 | 1 | |a Kratsch, Dieter |d 1959- |e Sonstige |0 (DE-588)1061050084 |4 oth | |
| 711 | 2 | |a WG |n 31 |d 2005 |c Metz |j Sonstige |0 (DE-588)10123292-5 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 3787 |w (DE-604)BV000000707 |9 3787 | |
| 856 | 4 | 2 | |m Digitalisierung UBPassau |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014613515&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-014613515 | |
Datensatz im Suchindex
| _version_ | 1820874979365879808 |
|---|---|
| adam_text |
Table
Invited Lectures
Hypertree Decompositions: Structure, Algorithms, and Applications
Georg Gottlob,
Francesco Scarcello
Combinatorial Search on Graphs Motivated by Bioinformatics
Applications: A Brief Survey
Mathilde Bouvel,
Regular Papers
Domination Search on Graphs with Low Dominating-Target-Number
Divesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun
Fully Dynamic Algorithm for Recognition and Modular Decomposition
of Permutation Graphs
Christophe
Approximating Rank-Width and Clique-Width Quickly
Sang-il Oum
Computing the
Orner Giménez, Petr
Minimizing NLC-Width is NP-Complete
Prank Gurski,
Channel Assignment and Improper Choosability of Graphs
Frédéric Havet, Jean-Sébastien
Computing Treewidth and Minimum Fill-in for Permutation Graphs in
Linear Time
Daniel
Roman Domination over Some Graph Classes
Mathieu
XII Table of Contents
Algorithms for Comparability of Matrices in Partial Orders Imposed
by Graph Homomorphisms
JiH
Network Discovery and Verification
Zuzana Beerliova, Felix
Alexander Hall, Michael Hoffmann,
L. Shankar Ram
Complete Graph Drawings Up to Triangle Mutations
Emeric Gioan
Collective Tree 1-Spanners for Interval Graphs
Derek G. Cornea, Feodor F. Dragan,
Chenyu Yan
On Stable Cutsets in Claw-Eree Graphs and Planar Graphs
Van Bang
Induced Subgraphs of Bounded Degree and Bounded Treewidth
Prosenfit
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
Pinar Heggernes, Daniel Lokshtanov
Ultimate Generalizations of LexBFS and LEX
Anne Berry, Richard Krueger,
Adding an Edge in a Cograph
Stavros D. N&olopoulos, Leonidas Polios
The Computational Complexity of Delay Management
Michael
Acyclic Choosability of Graphs with Small Maximum Degree
Daniel
Generating Colored Trees
Shin-ichi Nakano, Takeaki
Optimal Hypergraph Tree-Realization
Ephraim Korach,
Table of Contents XIII
Fixed-Parameter Algorithms for Protein Similarity Search Under
mRNA Structure Constraints
Guillaume Blin, Guillaume Fertin,
Stéphane
On the Fixed-Parameter Enumerability of Cluster Editing
Peter Damaschke
Locally Consistent Constraint Satisfaction Problems with Binary
Constraints
Manuel Bodirsky, Daniel Krai'
On Randomized Broadcasting in Star Graphs
Robert
Finding Disjoint Paths on Directed Acyclic Graphs
Torsten Tholey. 319
Approximation Algorithms for the Bi-criteria Weighted MAX-CUT
Problem
Eric Angel, Evripidis Bamjns, Laurent
Approximation Algorithms for the Weighted Independent Set Problem
Akihisa Kako, Takao Ono,
Approximation Algorithms for Unit Disk Graphs
Erik Jan van Leeuwen
Computation of Chromatic Polynomials Using
and Clique Trees
Pascal
Computing Branchwidth Via Efficient
Fedor Fomin,
Algorithms Based on the
Joachim Kneis, Daniel
Peter Rossmanith
Extending the Ttactability Border for Closest Leaf Powers
Michael
Bounding the Misclassification Error in Spectral Partitioning in the
Planted Partition Model
Joachim Giesen, Dieter Mitsche
XIV Table of Contents
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Ross
Linear-Time Counting Algorithms for Independent Sets in Chorda!
Graphs
Yoshio Okamoto, Takeaki
Faster Dynamic Algorithms for Chorda! Graphs, and an Application
to Phylogeny
Anne Berry, Alain Sigayret, Jeremy Spinrad
Recognizing HHDS-Free Graphs
Stavros D. Nikolopoulos, Leonidas Palios
Author Index |
| adam_txt |
Table
Invited Lectures
Hypertree Decompositions: Structure, Algorithms, and Applications
Georg Gottlob,
Francesco Scarcello
Combinatorial Search on Graphs Motivated by Bioinformatics
Applications: A Brief Survey
Mathilde Bouvel,
Regular Papers
Domination Search on Graphs with Low Dominating-Target-Number
Divesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun
Fully Dynamic Algorithm for Recognition and Modular Decomposition
of Permutation Graphs
Christophe
Approximating Rank-Width and Clique-Width Quickly
Sang-il Oum
Computing the
Orner Giménez, Petr
Minimizing NLC-Width is NP-Complete
Prank Gurski,
Channel Assignment and Improper Choosability of Graphs
Frédéric Havet, Jean-Sébastien
Computing Treewidth and Minimum Fill-in for Permutation Graphs in
Linear Time
Daniel
Roman Domination over Some Graph Classes
Mathieu
XII Table of Contents
Algorithms for Comparability of Matrices in Partial Orders Imposed
by Graph Homomorphisms
JiH
Network Discovery and Verification
Zuzana Beerliova, Felix
Alexander Hall, Michael Hoffmann,
L. Shankar Ram
Complete Graph Drawings Up to Triangle Mutations
Emeric Gioan
Collective Tree 1-Spanners for Interval Graphs
Derek G. Cornea, Feodor F. Dragan,
Chenyu Yan
On Stable Cutsets in Claw-Eree Graphs and Planar Graphs
Van Bang
Induced Subgraphs of Bounded Degree and Bounded Treewidth
Prosenfit
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
Pinar Heggernes, Daniel Lokshtanov
Ultimate Generalizations of LexBFS and LEX
Anne Berry, Richard Krueger,
Adding an Edge in a Cograph
Stavros D. N&olopoulos, Leonidas Polios
The Computational Complexity of Delay Management
Michael
Acyclic Choosability of Graphs with Small Maximum Degree
Daniel
Generating Colored Trees
Shin-ichi Nakano, Takeaki
Optimal Hypergraph Tree-Realization
Ephraim Korach,
Table of Contents XIII
Fixed-Parameter Algorithms for Protein Similarity Search Under
mRNA Structure Constraints
Guillaume Blin, Guillaume Fertin,
Stéphane
On the Fixed-Parameter Enumerability of Cluster Editing
Peter Damaschke
Locally Consistent Constraint Satisfaction Problems with Binary
Constraints
Manuel Bodirsky, Daniel Krai'
On Randomized Broadcasting in Star Graphs
Robert
Finding Disjoint Paths on Directed Acyclic Graphs
Torsten Tholey. 319
Approximation Algorithms for the Bi-criteria Weighted MAX-CUT
Problem
Eric Angel, Evripidis Bamjns, Laurent
Approximation Algorithms for the Weighted Independent Set Problem
Akihisa Kako, Takao Ono,
Approximation Algorithms for Unit Disk Graphs
Erik Jan van Leeuwen
Computation of Chromatic Polynomials Using
and Clique Trees
Pascal
Computing Branchwidth Via Efficient
Fedor Fomin,
Algorithms Based on the
Joachim Kneis, Daniel
Peter Rossmanith
Extending the Ttactability Border for Closest Leaf Powers
Michael
Bounding the Misclassification Error in Spectral Partitioning in the
Planted Partition Model
Joachim Giesen, Dieter Mitsche
XIV Table of Contents
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Ross
Linear-Time Counting Algorithms for Independent Sets in Chorda!
Graphs
Yoshio Okamoto, Takeaki
Faster Dynamic Algorithms for Chorda! Graphs, and an Application
to Phylogeny
Anne Berry, Alain Sigayret, Jeremy Spinrad
Recognizing HHDS-Free Graphs
Stavros D. Nikolopoulos, Leonidas Palios
Author Index |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author_GND | (DE-588)1061050084 |
| building | Verbundindex |
| bvnumber | BV021292685 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166 |
| callnumber-search | QA166 |
| callnumber-sort | QA 3166 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SS 4800 |
| classification_tum | DAT 537f MAT 055f |
| ctrlnum | (OCoLC)63175817 (DE-599)BVBBV021292685 |
| dewey-full | 004.015115 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.015115 |
| dewey-search | 004.015115 |
| dewey-sort | 14.015115 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV021292685</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20141118</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">060116s2005 xx ad|| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540310002</subfield><subfield code="9">3-540-31000-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540310006</subfield><subfield code="9">978-3-540-31000-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)63175817</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021292685</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.015115</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph theoretic concepts in computer science</subfield><subfield code="b">31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005 ; revised selected papers</subfield><subfield code="c">Dieter Kratsch (ed.)</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Graph-theoretic concepts in computer science</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 470 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">3787</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatique - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield><subfield code="x">Data processing</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="651" ind1=" " ind2="7"><subfield code="a">Metz <2005></subfield><subfield code="2">swd</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kratsch, Dieter</subfield><subfield code="d">1959-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1061050084</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">WG</subfield><subfield code="n">31</subfield><subfield code="d">2005</subfield><subfield code="c">Metz</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)10123292-5</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">3787</subfield><subfield code="w">(DE-604)BV000000707</subfield><subfield code="9">3787</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UBPassau</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014613515&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-014613515</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| geographic | Metz <2005> swd |
| geographic_facet | Metz <2005> |
| id | DE-604.BV021292685 |
| illustrated | Illustrated |
| index_date | 2024-07-02T13:50:18Z |
| indexdate | 2025-01-10T15:08:20Z |
| institution | BVB |
| institution_GND | (DE-588)10123292-5 |
| isbn | 3540310002 9783540310006 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-014613515 |
| oclc_num | 63175817 |
| open_access_boolean | |
| owner | DE-739 DE-91G DE-BY-TUM DE-11 DE-706 DE-83 |
| owner_facet | DE-739 DE-91G DE-BY-TUM DE-11 DE-706 DE-83 |
| physical | XIV, 470 S. Ill., graph. Darst. |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Graph theoretic concepts in computer science 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005 ; revised selected papers Dieter Kratsch (ed.) Graph-theoretic concepts in computer science Berlin [u.a.] Springer 2005 XIV, 470 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 3787 Graphentheorie swd Graphes, Théorie des - Congrès Informatique - Congrès Theoretische Informatik swd Datenverarbeitung Informatik Computer science Congresses Graph theory Congresses Graph theory Data processing Congresses Metz <2005> swd (DE-588)1071861417 Konferenzschrift gnd-content Kratsch, Dieter 1959- Sonstige (DE-588)1061050084 oth WG 31 2005 Metz Sonstige (DE-588)10123292-5 oth Lecture notes in computer science 3787 (DE-604)BV000000707 3787 Digitalisierung UBPassau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014613515&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Graph theoretic concepts in computer science 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005 ; revised selected papers Lecture notes in computer science Graphentheorie swd Graphes, Théorie des - Congrès Informatique - Congrès Theoretische Informatik swd Datenverarbeitung Informatik Computer science Congresses Graph theory Congresses Graph theory Data processing Congresses |
| subject_GND | (DE-588)1071861417 |
| title | Graph theoretic concepts in computer science 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005 ; revised selected papers |
| title_alt | Graph-theoretic concepts in computer science |
| title_auth | Graph theoretic concepts in computer science 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005 ; revised selected papers |
| title_exact_search | Graph theoretic concepts in computer science 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005 ; revised selected papers |
| title_exact_search_txtP | Graph theoretic concepts in computer science 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005 ; revised selected papers |
| title_full | Graph theoretic concepts in computer science 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005 ; revised selected papers Dieter Kratsch (ed.) |
| title_fullStr | Graph theoretic concepts in computer science 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005 ; revised selected papers Dieter Kratsch (ed.) |
| title_full_unstemmed | Graph theoretic concepts in computer science 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005 ; revised selected papers Dieter Kratsch (ed.) |
| title_short | Graph theoretic concepts in computer science |
| title_sort | graph theoretic concepts in computer science 31st international workshop wg 2005 metz france june 23 25 2005 revised selected papers |
| title_sub | 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005 ; revised selected papers |
| topic | Graphentheorie swd Graphes, Théorie des - Congrès Informatique - Congrès Theoretische Informatik swd Datenverarbeitung Informatik Computer science Congresses Graph theory Congresses Graph theory Data processing Congresses |
| topic_facet | Graphentheorie Graphes, Théorie des - Congrès Informatique - Congrès Theoretische Informatik Datenverarbeitung Informatik Computer science Congresses Graph theory Congresses Graph theory Data processing Congresses Metz <2005> Konferenzschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014613515&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000707 |
| work_keys_str_mv | AT kratschdieter graphtheoreticconceptsincomputerscience31stinternationalworkshopwg2005metzfrancejune23252005revisedselectedpapers AT wgmetz graphtheoreticconceptsincomputerscience31stinternationalworkshopwg2005metzfrancejune23252005revisedselectedpapers AT kratschdieter graphtheoreticconceptsincomputerscience AT wgmetz graphtheoreticconceptsincomputerscience |