Graph theoretic concepts in computer science: 28th international workshop, WG 2002, Česky Krumlov, Czech Republic, June 13 - 15, 2002 ; revised papers
Saved in:
| Format: | Conference Proceeding Book |
|---|---|
| Language: | English |
| Published: |
Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London
Springer
2002
|
| Series: | Lecture notes in computer science
2573 |
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Item Description: | Literaturangaben |
| Physical Description: | XI, 422 S. graph. Darst. |
| ISBN: | 3540003312 |
Staff View
MARC
| LEADER | 00000nam a22000008cb4500 | ||
|---|---|---|---|
| 001 | BV015634605 | ||
| 003 | DE-604 | ||
| 005 | 20030902 | ||
| 007 | t| | ||
| 008 | 021216s2002 gw d||| |||| 10||| eng d | ||
| 016 | 7 | |a 966200527 |2 DE-101 | |
| 020 | |a 3540003312 |9 3-540-00331-2 | ||
| 035 | |a (OCoLC)51526956 | ||
| 035 | |a (DE-599)BVBBV015634605 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-824 |a DE-384 |a DE-739 |a DE-91G |a DE-11 |a DE-188 |a DE-706 | ||
| 050 | 0 | |a QA166 | |
| 082 | 0 | |a 004.015115 |2 21 | |
| 084 | |a MAT 055f |2 stub | ||
| 245 | 1 | 0 | |a Graph theoretic concepts in computer science |b 28th international workshop, WG 2002, Česky Krumlov, Czech Republic, June 13 - 15, 2002 ; revised papers |c Luděk Kučera, ed. |
| 246 | 1 | 3 | |a Graph-theoretic concepts in computer science |
| 264 | 1 | |a Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London |b Springer |c 2002 | |
| 300 | |a XI, 422 S. |b 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 2573 | |
| 500 | |a Literaturangaben | ||
| 650 | 7 | |a Fundamentele informatica |2 gtt | |
| 650 | 7 | |a Grafentheorie |2 gtt | |
| 650 | 4 | |a Graphes, Théorie des - Congrès | |
| 650 | 4 | |a Graphes, Théorie des - Informatique - Congrès | |
| 650 | 4 | |a Informatique - Congrès | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Algorithms |v Congresses | |
| 650 | 4 | |a Computer science |v Congresses | |
| 650 | 4 | |a Graph theory |x Data processing |v Congresses | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2002 |z Krumau |2 gnd-content | |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | 1 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Kučera, Luděk |e Sonstige |4 oth | |
| 711 | 2 | |a WG |n 28 |d 2002 |c Český Krumlov |j Sonstige |0 (DE-588)10051337-2 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 2573 |w (DE-604)BV000000607 |9 2573 | |
| 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=010114969&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-010114969 | |
Record in the Search Index
| _version_ | 1820874917345755136 |
|---|---|
| adam_text |
TABLE OF CONTENTS
MAXIMUM CARDINALITY SEARCH FOR COMPUTING MINIMAL TRIANGULATIONS
.
1
ANNE BERRY, JEAN R.S. BLAIR, AND PINAR HEGGERNES
DNA SEQUENCING, EULERIAN GRAPHS,
AND THE EXACT PERFECT MATCHING PROBLEM
.
13
JACEK B*LA*ZEWICZ, PIOTR FORMANOWICZ, MARTA KASPRZAK,
PETRA SCHUURMAN, AND GERHARD J. WOEGINGER
ON THE MINIMUM SIZE OF A CONTRACTION-UNIVERSAL TREE
.
25
OLIVIER BODINI
OPTIMAL AREA ALGORITHM FOR PLANAR POLYLINE DRAWINGS
.
35
NICOLAS BONICHON, BERTRAND LE SA¨EC, AND MOHAMED MOSBAH
CYCLES IN GENERALIZED NETWORKS
.
47
FRANZ J. BRANDENBURG
NEW GRAPH CLASSES OF BOUNDED CLIQUE-WIDTH
.
57
ANDREAS BRANDST¨ADT, FEODOR F. DRAGAN, HO`ANG-OANH LE,
AND RAFFAELE MOSCA
MORE ABOUT SUBCOLORINGS
.
68
HAJO BROERSMA, FEDOR V. FOMIN, JAROSLAV NE*SET*RIL,
AND GERHARD J. WOEGINGER
SEARCH IN INDECOMPOSABLE GRAPHS
.
80
ALAIN COURNIER
ON THE COMPLEXITY OF (
K, L
)-GRAPH SANDWICH PROBLEMS
.
92
SIMONE DANTAS, CELINA M.H. DE FIGUEIREDO, AND LUERBIO FARIA
ALGORITHMS AND MODELS FOR THE ON-LINE VERTEX-COVERING
.
102
MARC DEMANGE AND VANGELIS TH. PASCHOS
WEIGHTED NODE COLORING: WHEN STABLE SETS ARE EXPENSIVE
.
114
MARC DEMANGE, D. DE WERRA, J. MONNOT, AND VANGELIS TH. PASCHOS
THE COMPLEXITY OF RESTRICTIVE
H
-COLORING
.
126
JOSEP D´*AZ, MARIA SERNA, AND DIMITRIOS M. THILIKOS
A NEW 3-COLOR CRITERION FOR PLANAR GRAPHS
.
138
KRZYSZTOF DIKS, LUKASZ KOWALIK, AND MACIEJ KUROWSKI
AN ADDITIVE STRETCHED ROUTING SCHEME FOR CHORDAL GRAPHS
.
150
YON DOURISBOURE
X TABLE OF CONTENTS
COMPLEXITY OF PATTERN COLORING OF CYCLE SYSTEMS
.
164
ZDEN*EK DVO*R´AK, JAN K´ARA, DANIEL KR´AL*, AND OND*REJ PANGR´AC
SAFE REDUCTION RULES FOR WEIGHTED TREEWIDTH
.
176
FRANK VAN DEN EIJKHOF AND HANS L. BODLAENDER
GRAPH SEPARATOR ALGORITHMS: A REFINED ANALYSIS
.
186
HENNING FERNAU
GENERALIZED
H
-COLORING AND
H
-COVERING OF TREES
.
198
JI*R´* FIALA, PINAR HEGGERNES, PETTER KRISTIANSEN, AND JAN ARNE TELLE
THE COMPLEXITY OF APPROXIMATING THE ORIENTED DIAMETER
OF CHORDAL GRAPHS
.
211
FEDOR V. FOMIN, MART´*N MATAMALA, AND IVAN RAPAPORT
RADIOCOLORINGS IN PERIODIC PLANAR GRAPHS: PSPACE-COMPLETENESS
AND EFFICIENT APPROXIMATIONS FOR THE OPTIMAL RANGE OF FREQUENCIES
.
223
D.A. FOTAKIS, S.E. NIKOLETSEAS, V.G. PAPADOPOULOU, P.G. SPIRAKIS
COMPLETELY INDEPENDENT SPANNING TREES IN MAXIMAL PLANAR GRAPHS
.
235
TORU HASUNUMA
FACETS OF THE DIRECTED ACYCLIC GRAPH LAYERING POLYTOPE
.
246
PATRICK HEALY AND NIKOLA S. NIKOLOV
RECOGNIZING WHEN HEURISTICS CAN APPROXIMATE MINIMUM VERTEX
COVERS IS COMPLETE FOR PARALLEL ACCESS TO NP
.
258
EDITH HEMASPAANDRA, J¨ORG ROTHE, AND HOLGER SPAKOWSKI
COMPLEXITY OF SOME INFINITE GAMES PLAYED ON FINITE GRAPHS
.
270
HAJIME ISHIHARA AND BAKHADYR KHOUSSAINOV
NEW ALGORITHMS FOR
K
*FACE COVER,
K
*FEEDBACK VERTEX SET,
AND
K
*DISJOINT CYCLES ON PLANE AND PLANAR GRAPHS
.
282
TON KLOKS, C.M. LEE, AND JIPING LIU
A MULTI-SCALE ALGORITHM FOR THE LINEAR ARRANGEMENT PROBLEM
.
296
YEHUDA KOREN AND DAVID HAREL
ON THE B-CHROMATIC NUMBER OF GRAPHS
.
310
JAN KRATOCHV´*L, ZSOLT TUZA, AND MARGIT VOIGT
BUDGETED MAXIMUM GRAPH COVERAGE
.
321
SVEN OLIVER KRUMKE, MADHAV V. MARATHE, DIANA POENSGEN,
S.S. RAVI, AND HANS-CHRISTOPH WIRTH
ONLINE CALL ADMISSION IN OPTICAL NETWORKS WITH LARGER DEMANDS
.
333
SVEN OLIVER KRUMKE AND DIANA POENSGEN
TABLE OF CONTENTS XI
THE FOREST WRAPPING PROBLEM ON OUTERPLANAR GRAPHS
.
345
ISABELLA LARI, FEDERICA RICCA, AND ANDREA SCOZZARI
ON THE RECOGNITION OF
P
4
-COMPARABILITY GRAPHS
.
355
STAVROS D. NIKOLOPOULOS AND LEONIDAS PALIOS
BEND-MINIMUM ORTHOGONAL DRAWINGS OF PLANE 3-GRAPHS
.
367
MD. SAIDUR RAHMAN AND TAKAO NISHIZEKI
CLUSTER GRAPH MODIFICATION PROBLEMS
.
379
RON SHAMIR, RODED SHARAN, AND DEKEL TSUR
TWO COUNTEREXAMPLES IN GRAPH DRAWING
.
391
O. S´YKORA, L.A. SZ´EKELY, AND I. VRT*O
CONNECTED AND LOOSELY CONNECTED LIST HOMOMORPHISMS
.
399
NARAYAN VIKAS
ANY LOAD-BALANCING REGIMEN FOR EVOLVING TREE COMPUTATIONS
ON CIRCULANT GRAPHS IS ASYMPTOTICALLY OPTIMAL
.
413
ROLF WANKA
AUTHOR INDEX
.
421 |
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV015634605 |
| 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 | MAT 055f |
| ctrlnum | (OCoLC)51526956 (DE-599)BVBBV015634605 |
| 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 a22000008cb4500</leader><controlfield tag="001">BV015634605</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20030902</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">021216s2002 gw d||| |||| 10||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">966200527</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540003312</subfield><subfield code="9">3-540-00331-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)51526956</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV015634605</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-824</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-706</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">21</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">28th international workshop, WG 2002, Česky Krumlov, Czech Republic, June 13 - 15, 2002 ; revised papers</subfield><subfield code="c">Luděk Kučera, 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 ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London</subfield><subfield code="b">Springer</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 422 S.</subfield><subfield code="b">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">2573</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fundamentele informatica</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafentheorie</subfield><subfield code="2">gtt</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">Graphes, Théorie des - Informatique - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatique - Congrès</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">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="x">Data processing</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">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</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">2002</subfield><subfield code="z">Krumau</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</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">Kučera, Luděk</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">28</subfield><subfield code="d">2002</subfield><subfield code="c">Český Krumlov</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)10051337-2</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">2573</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">2573</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=010114969&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-010114969</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2002 Krumau gnd-content |
| genre_facet | Konferenzschrift 2002 Krumau |
| id | DE-604.BV015634605 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:07:21Z |
| institution | BVB |
| institution_GND | (DE-588)10051337-2 |
| isbn | 3540003312 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010114969 |
| oclc_num | 51526956 |
| open_access_boolean | |
| owner | DE-824 DE-384 DE-739 DE-91G DE-BY-TUM DE-11 DE-188 DE-706 |
| owner_facet | DE-824 DE-384 DE-739 DE-91G DE-BY-TUM DE-11 DE-188 DE-706 |
| physical | XI, 422 S. graph. Darst. |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Graph theoretic concepts in computer science 28th international workshop, WG 2002, Česky Krumlov, Czech Republic, June 13 - 15, 2002 ; revised papers Luděk Kučera, ed. Graph-theoretic concepts in computer science Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London Springer 2002 XI, 422 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 2573 Literaturangaben Fundamentele informatica gtt Grafentheorie gtt Graphes, Théorie des - Congrès Graphes, Théorie des - Informatique - Congrès Informatique - Congrès Datenverarbeitung Informatik Algorithms Congresses Computer science Congresses Graph theory Data processing Congresses Graphentheorie (DE-588)4113782-6 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2002 Krumau gnd-content Theoretische Informatik (DE-588)4196735-5 s Graphentheorie (DE-588)4113782-6 s DE-604 Kučera, Luděk Sonstige oth WG 28 2002 Český Krumlov Sonstige (DE-588)10051337-2 oth Lecture notes in computer science 2573 (DE-604)BV000000607 2573 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010114969&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Graph theoretic concepts in computer science 28th international workshop, WG 2002, Česky Krumlov, Czech Republic, June 13 - 15, 2002 ; revised papers Lecture notes in computer science Fundamentele informatica gtt Grafentheorie gtt Graphes, Théorie des - Congrès Graphes, Théorie des - Informatique - Congrès Informatique - Congrès Datenverarbeitung Informatik Algorithms Congresses Computer science Congresses Graph theory Data processing Congresses Graphentheorie (DE-588)4113782-6 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4196735-5 (DE-588)1071861417 |
| title | Graph theoretic concepts in computer science 28th international workshop, WG 2002, Česky Krumlov, Czech Republic, June 13 - 15, 2002 ; revised papers |
| title_alt | Graph-theoretic concepts in computer science |
| title_auth | Graph theoretic concepts in computer science 28th international workshop, WG 2002, Česky Krumlov, Czech Republic, June 13 - 15, 2002 ; revised papers |
| title_exact_search | Graph theoretic concepts in computer science 28th international workshop, WG 2002, Česky Krumlov, Czech Republic, June 13 - 15, 2002 ; revised papers |
| title_full | Graph theoretic concepts in computer science 28th international workshop, WG 2002, Česky Krumlov, Czech Republic, June 13 - 15, 2002 ; revised papers Luděk Kučera, ed. |
| title_fullStr | Graph theoretic concepts in computer science 28th international workshop, WG 2002, Česky Krumlov, Czech Republic, June 13 - 15, 2002 ; revised papers Luděk Kučera, ed. |
| title_full_unstemmed | Graph theoretic concepts in computer science 28th international workshop, WG 2002, Česky Krumlov, Czech Republic, June 13 - 15, 2002 ; revised papers Luděk Kučera, ed. |
| title_short | Graph theoretic concepts in computer science |
| title_sort | graph theoretic concepts in computer science 28th international workshop wg 2002 cesky krumlov czech republic june 13 15 2002 revised papers |
| title_sub | 28th international workshop, WG 2002, Česky Krumlov, Czech Republic, June 13 - 15, 2002 ; revised papers |
| topic | Fundamentele informatica gtt Grafentheorie gtt Graphes, Théorie des - Congrès Graphes, Théorie des - Informatique - Congrès Informatique - Congrès Datenverarbeitung Informatik Algorithms Congresses Computer science Congresses Graph theory Data processing Congresses Graphentheorie (DE-588)4113782-6 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| topic_facet | Fundamentele informatica Grafentheorie Graphes, Théorie des - Congrès Graphes, Théorie des - Informatique - Congrès Informatique - Congrès Datenverarbeitung Informatik Algorithms Congresses Computer science Congresses Graph theory Data processing Congresses Graphentheorie Theoretische Informatik Konferenzschrift 2002 Krumau |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010114969&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT kuceraludek graphtheoreticconceptsincomputerscience28thinternationalworkshopwg2002ceskykrumlovczechrepublicjune13152002revisedpapers AT wgceskykrumlov graphtheoreticconceptsincomputerscience28thinternationalworkshopwg2002ceskykrumlovczechrepublicjune13152002revisedpapers AT kuceraludek graphtheoreticconceptsincomputerscience AT wgceskykrumlov graphtheoreticconceptsincomputerscience |