Graph theoretic concepts in computer science: 34th international workshop, WG 2008, Durham, UK, June 30 - July 2, 2008 ; revised papers
Gespeichert in:
Format: | Tagungsbericht Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2008
|
Schriftenreihe: | Lecture notes in computer science
5344 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | Literaturangaben |
Beschreibung: | XIII, 386 S. graph. Darst. 24 cm |
ISBN: | 9783540922476 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV035385154 | ||
003 | DE-604 | ||
005 | 20090507 | ||
007 | t| | ||
008 | 090323s2008 xx d||| |||| 10||| eng d | ||
015 | |a 08,N49,0018 |2 dnb | ||
016 | 7 | |a 991289374 |2 DE-101 | |
020 | |a 9783540922476 |c kart. : EUR 60.94 (freier Pr.), sfr 95.00 (freier Pr.) |9 978-3-540-92247-6 | ||
024 | 3 | |a 9783540922476 | |
028 | 5 | 2 | |a 12585687 |
035 | |a (OCoLC)297145502 | ||
035 | |a (DE-599)DNB991289374 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-706 |a DE-91G |a DE-83 |a DE-11 | ||
050 | 0 | |a QA166 | |
082 | 0 | |a 004.015115 |2 22/ger | |
082 | 0 | |a 004.015115 |2 22//ger | |
084 | |a 004 |2 sdnb | ||
084 | |a DAT 537f |2 stub | ||
084 | |a MAT 055f |2 stub | ||
084 | |a 510 |2 sdnb | ||
245 | 1 | 0 | |a Graph theoretic concepts in computer science |b 34th international workshop, WG 2008, Durham, UK, June 30 - July 2, 2008 ; revised papers |c Hajo Broersma ... eds. |
264 | 1 | |a Berlin [u.a.] |b Springer |c 2008 | |
300 | |a XIII, 386 S. |b graph. Darst. |c 24 cm | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Lecture notes in computer science |v 5344 | |
500 | |a Literaturangaben | ||
650 | 4 | |a Informatik - Graphentheorie - Kongress - Durham <2008> | |
650 | 4 | |a Informatik | |
650 | 4 | |a Computer algorithms |v Congresses | |
650 | 4 | |a Computer science |v Congresses | |
650 | 4 | |a Graph theory |v Congresses | |
650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2008 |z Durham |2 gnd-content | |
689 | 0 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
689 | 0 | 1 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Broersma, Hajo |e Sonstige |4 oth | |
711 | 2 | |a WG |n 34 |d 2008 |c Durham |j Sonstige |0 (DE-588)6075957-4 |4 oth | |
830 | 0 | |a Lecture notes in computer science |v 5344 |w (DE-604)BV000000607 |9 5344 | |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017306038&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-017306038 |
Datensatz im Suchindex
_version_ | 1820875112303296512 |
---|---|
adam_text |
TABLE OF CONTENTS INVITED CONTRIBUTIONS (UN)-STABLE ROUTING IN THE
INTERNET: A SURVEY FROM THE ALGORITHMIC PERSPECTIVE 1 LUCA CITTADINI,
GIUSEPPE DI BATTISTA, AND MASSIMO RIMONDINI MEMORY EFFICIENT ANONYMOUS
GRAPH EXPLORATION 14 LESZEH GQSIENIEC AND TOMASZ RADZIK ALGORITHMIC META
THEOREMS 30 MARTIN GROHE REGULAER PAPERS A MOST GENERAL EDGE ELIMINATION
POLYNOMIAL 31 ILIA AVERBOUCH, BENNY GODLIN, AND JOHANN A. MAKOWSKY
APPROXIMATING THE METRIC TSP IN LINEAR TIME 43 DAVIDE BILD, LUCA
FORLIZZI, AND GUIDO PROIETTI THE VALVE LOCATION PROBLEM IN SIMPLE
NETWORK TOPOLOGIES 55 HANS L. BODLAENDER, ALEXANDER GRIGORIEV, NADEJDA
V. GRIGORIEVA, AND ALBERT HENDRIKS A 3/2-APPROXIMATION ALGORITHM FOR
FINDING SPANNING TREES WITH MANY LEAVES IN CUBIC GRAPHS 66 PAUL BONSMA
AND FLORIAN ZICKFELD ON THE PSEUDO-ACHROMATIC NUMBER PROBLEM 78 JIANER
CHEN, IYAD A. KANJ, JIE MENG, GE XIA, AND FENGHUI ZHANG MAKING ROLE
ASSIGNMENT FEASIBLE: A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING
ECOLOGICAL COLORINGS 90 PILU CRESCENZI, MIRIAM DI IANNI, FEDERICO GRECO,
GIANLUCA ROSSI, AND PAOLA VOCCA FASTER EXACT BANDWIDTH 101 MAREK CYGAN
AND MARCIN PILIPCZUK ADDITIVE SPANNERS FOR CIRCLE GRAPHS AND POLYGONAL
GRAPHS 110 FEODOR BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/991289374 DIGITALISIERT DURCH XII TABLE OF CONTENTS
UPWARD STRAIGHT-LINE EMBEDDINGS OF DIRECTED GRAPHS INTO POINT SETS 122
ALEJANDRO ESTRELLA-BALDERRAMA, FABRIZIO FRATI, AND STEPHEN G. KOBOUROV
COMPLEXITY OF THE PACKING COLORING PROBLEM FOR TREES 134 JIFI FIALA AND
PETR A. GOLOVACH CHARACTERIZATIONS OF RESTRICTED PAIRS OF PLANAR GRAPHS
ALLOWING SIMULTANEOUS EMBEDDING WITH FIXED EDGES 146 J. JOSEPH FOWLER,
MICHAEL JUENGER, STEPHEN KOBOUROV, AND MICHAEL SCHULZ A LOWER BOUND ON
THE AREA REQUIREMENTS OF SERIES-PARALLEL GRAPHS . 159 FABRIZIO FRATI
ON INDEPENDENT SETS AND BICLIQUES IN GRAPHS 171 SERGE GASPERS, DIETER
KRATSCH, AND MATHIEU LIEDLOFF EVALUATIONS OF GRAPH POLYNOMIALS 183 BENNY
GODLIN, TOMER KOTEK, AND JOHANN A. MAKOWSKY PARAMETERIZED COMPLEXITY FOR
DOMINATION PROBLEMS ON DEGENERATE GRAPHS 195 PETR A. GOLOVACH AND YNGVE
VILLANGER AN ALGORITHM FOR FINDING INPUT-OUTPUT CONSTRAINED CONVEX SETS
IN AN ACYCLIC DIGRAPH 206 GREGORY GUTIN, ADRIAN JOHNSTONE, JOSEPH
REDDINGTON, ELIZABETH SCOTT, AND ANDERS YEO CUTWIDTH OF SPLIT GRAPHS,
THRESHOLD GRAPHS, AND PROPER INTERVAL GRAPHS 218 PINAR HEGGERNES, DANIEL
LOKSHTANOV, RODICA MIHAI, AND CHARIS PAPADOPOULOS THE RANK-WIDTH OF THE
SQUARE GRID 230 VIT JELINEK IMPROVE TABLE OF CONTENTS XIII WHAT IS
BETWEEN CHORDAL AND WEAKLY CHORDAL GRAPHS? 275 ELAD COHEN, MARTIN
CHARLES GOLUMBIC, MARINA LIPSHTEYN, AND MICHAL STERN PARAMETERIZED GRAPH
CLEANING PROBLEMS 287 DANIEL MARX AND ILDIKOE SCHLOTTER TRAFRC GROOMING
IN UNIDIRECTIONAL WDM RINGS WITH BOUNDED DEGREE REQUEST GRAPH 300 XAVIER
MUNOZ AND IGNASI SAU FAST ROBBER IN PLANAR GRAPHS 312 NICOLAS NISSE AND
KAROL SUCHAN FROM A CIRCULAR-ARC MODEL TO A PROPER CIRCULAR-ARC MODEL
324 YAHAV NUSSBAUM DIGRAPH DECOMPOSITIONS AND MONOTONICITY IN DIGRAPH
SEARCHING 336 STEPHAN KREUTZER AND SEBASTIAN ORDYNIAK SEARCHING FOR A
VISIBLE, LAZY FUGITIVE 348 DAVID RICHERBY AND DIMITRIOS M. THILIKOS A
FASTER SHORTEST-PATHS ALGORITHM FOR MINOR-CLOSED GRAPH CLASSES . 360
SIAMAK TAZARI AND MATTHIAS MUELLER-HANNEMANN LOCAL CONSTRUCTION AND
COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS (EXTENDED
ABSTRACT) 372 ANDREAS WIESE AND EVANGELOS KRANAKIS AUTHOR INDEX 385 |
any_adam_object | 1 |
building | Verbundindex |
bvnumber | BV035385154 |
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)297145502 (DE-599)DNB991289374 |
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 |
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">BV035385154</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090507</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">090323s2008 xx d||| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">08,N49,0018</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">991289374</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540922476</subfield><subfield code="c">kart. : EUR 60.94 (freier Pr.), sfr 95.00 (freier Pr.)</subfield><subfield code="9">978-3-540-92247-6</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783540922476</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">12585687</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)297145502</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB991289374</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</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/ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.015115</subfield><subfield code="2">22//ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</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="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph theoretic concepts in computer science</subfield><subfield code="b">34th international workshop, WG 2008, Durham, UK, June 30 - July 2, 2008 ; revised papers</subfield><subfield code="c">Hajo Broersma ... eds.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 386 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">24 cm</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">5344</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik - Graphentheorie - Kongress - Durham <2008></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield><subfield code="v">Congresses</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="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2008</subfield><subfield code="z">Durham</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Broersma, Hajo</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">WG</subfield><subfield code="n">34</subfield><subfield code="d">2008</subfield><subfield code="c">Durham</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)6075957-4</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">5344</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">5344</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</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=017306038&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-017306038</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 2008 Durham gnd-content |
genre_facet | Konferenzschrift 2008 Durham |
id | DE-604.BV035385154 |
illustrated | Illustrated |
indexdate | 2025-01-10T15:10:26Z |
institution | BVB |
institution_GND | (DE-588)6075957-4 |
isbn | 9783540922476 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017306038 |
oclc_num | 297145502 |
open_access_boolean | |
owner | DE-706 DE-91G DE-BY-TUM DE-83 DE-11 |
owner_facet | DE-706 DE-91G DE-BY-TUM DE-83 DE-11 |
physical | XIII, 386 S. graph. Darst. 24 cm |
publishDate | 2008 |
publishDateSearch | 2008 |
publishDateSort | 2008 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | Graph theoretic concepts in computer science 34th international workshop, WG 2008, Durham, UK, June 30 - July 2, 2008 ; revised papers Hajo Broersma ... eds. Berlin [u.a.] Springer 2008 XIII, 386 S. graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 5344 Literaturangaben Informatik - Graphentheorie - Kongress - Durham <2008> Informatik Computer algorithms Congresses Computer science Congresses Graph theory Congresses Graphentheorie (DE-588)4113782-6 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2008 Durham gnd-content Informatik (DE-588)4026894-9 s Graphentheorie (DE-588)4113782-6 s DE-604 Broersma, Hajo Sonstige oth WG 34 2008 Durham Sonstige (DE-588)6075957-4 oth Lecture notes in computer science 5344 (DE-604)BV000000607 5344 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017306038&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Graph theoretic concepts in computer science 34th international workshop, WG 2008, Durham, UK, June 30 - July 2, 2008 ; revised papers Lecture notes in computer science Informatik - Graphentheorie - Kongress - Durham <2008> Informatik Computer algorithms Congresses Computer science Congresses Graph theory Congresses Graphentheorie (DE-588)4113782-6 gnd Informatik (DE-588)4026894-9 gnd |
subject_GND | (DE-588)4113782-6 (DE-588)4026894-9 (DE-588)1071861417 |
title | Graph theoretic concepts in computer science 34th international workshop, WG 2008, Durham, UK, June 30 - July 2, 2008 ; revised papers |
title_auth | Graph theoretic concepts in computer science 34th international workshop, WG 2008, Durham, UK, June 30 - July 2, 2008 ; revised papers |
title_exact_search | Graph theoretic concepts in computer science 34th international workshop, WG 2008, Durham, UK, June 30 - July 2, 2008 ; revised papers |
title_full | Graph theoretic concepts in computer science 34th international workshop, WG 2008, Durham, UK, June 30 - July 2, 2008 ; revised papers Hajo Broersma ... eds. |
title_fullStr | Graph theoretic concepts in computer science 34th international workshop, WG 2008, Durham, UK, June 30 - July 2, 2008 ; revised papers Hajo Broersma ... eds. |
title_full_unstemmed | Graph theoretic concepts in computer science 34th international workshop, WG 2008, Durham, UK, June 30 - July 2, 2008 ; revised papers Hajo Broersma ... eds. |
title_short | Graph theoretic concepts in computer science |
title_sort | graph theoretic concepts in computer science 34th international workshop wg 2008 durham uk june 30 july 2 2008 revised papers |
title_sub | 34th international workshop, WG 2008, Durham, UK, June 30 - July 2, 2008 ; revised papers |
topic | Informatik - Graphentheorie - Kongress - Durham <2008> Informatik Computer algorithms Congresses Computer science Congresses Graph theory Congresses Graphentheorie (DE-588)4113782-6 gnd Informatik (DE-588)4026894-9 gnd |
topic_facet | Informatik - Graphentheorie - Kongress - Durham <2008> Informatik Computer algorithms Congresses Computer science Congresses Graph theory Congresses Graphentheorie Konferenzschrift 2008 Durham |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017306038&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV000000607 |
work_keys_str_mv | AT broersmahajo graphtheoreticconceptsincomputerscience34thinternationalworkshopwg2008durhamukjune30july22008revisedpapers AT wgdurham graphtheoreticconceptsincomputerscience34thinternationalworkshopwg2008durhamukjune30july22008revisedpapers |