Graph theoretic concepts in computer science: 21st international workshop, WG '95, Aachen, Germany, June 20 - 22, 1995 ; proceedings
Saved in:
| Format: | Conference Proceeding Book |
|---|---|
| Language: | English |
| Published: |
Berlin [u.a.]
Springer
1995
|
| Series: | Lecture notes in computer science
1017 |
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | XI, 406 S. Ill., graph. Darst. |
| ISBN: | 3540606181 |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010483951 | ||
| 003 | DE-604 | ||
| 005 | 19960130 | ||
| 007 | t| | ||
| 008 | 951113s1995 gw ad|| |||| 10||| eng d | ||
| 016 | 7 | |a 945723474 |2 DE-101 | |
| 020 | |a 3540606181 |9 3-540-60618-1 | ||
| 035 | |a (OCoLC)33867342 | ||
| 035 | |a (DE-599)BVBBV010483951 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-91G |a DE-739 |a DE-384 |a DE-29T |a DE-19 |a DE-20 |a DE-83 |a DE-11 |a DE-188 |a DE-706 | ||
| 050 | 0 | |a QA166 | |
| 082 | 0 | |a 004.01 | |
| 084 | |a ST 276 |0 (DE-625)143642: |2 rvk | ||
| 084 | |a MAT 055f |2 stub | ||
| 084 | |a 27 |2 sdnb | ||
| 084 | |a 28 |2 sdnb | ||
| 245 | 1 | 0 | |a Graph theoretic concepts in computer science |b 21st international workshop, WG '95, Aachen, Germany, June 20 - 22, 1995 ; proceedings |c Manfred Nagl (ed.) |
| 246 | 1 | 3 | |a Graph-theoretic concepts in computer science |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1995 | |
| 300 | |a XI, 406 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 1017 | |
| 650 | 4 | |a Algorithmes - Congrès | |
| 650 | 7 | |a Algorithmes - Congrès |2 ram | |
| 650 | 4 | |a Graphes, Théorie des - Congrès | |
| 650 | 7 | |a Graphes, Théorie des - Congrès |2 ram | |
| 650 | 4 | |a Informatique - Congrès | |
| 650 | 7 | |a coloration graphe |2 inriac | |
| 650 | 7 | |a décomposition graphe |2 inriac | |
| 650 | 7 | |a routage |2 inriac | |
| 650 | 7 | |a réécriture |2 inriac | |
| 650 | 7 | |a théorie graphe |2 inriac | |
| 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 Datenverarbeitung |0 (DE-588)4011152-0 |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 1995 |z Aachen |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 | |
| 689 | 1 | 0 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 1 | 1 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Nagl, Manfred |e Sonstige |4 oth | |
| 711 | 2 | |a WG |n 21 |d 1995 |c Aachen |j Sonstige |0 (DE-588)2150812-4 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 1017 |w (DE-604)BV000000607 |9 1017 | |
| 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=006986758&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006986758 | |
Record in the Search Index
| _version_ | 1820874849111769088 |
|---|---|
| adam_text |
CONTENTS
VC-DIMENSIONS
FOR
GRAPHS
E.
KRANAKIS,
D.
KRIZANC,
B.
RUF,
J.
URRUTIA,
G.
J.
WOEGINGER
.
1
FINDING
AND
COUNTING
SMALL
INDUCED
SUBGRAPHS
EFFICIENTLY
T.KLOKS.D.KRATSCH.H.
MAILER
.
14
ON
THE
ISOMORPHISM
OF
GRAPHS
WITH
FEW
P4S
L.
BABEL,
S.
OLARIU
.
24
A
DYNAMIC
ALGORITHM
FOR
LINE
GRAPH
RECOGNITION
D.G.
DEGIORGI,
K.
SIMON
.
37
INCREMENTAL
HIVE
GRAPH
F.
D
'
AMORE,
R.
GIACCIO
.
49
PLANARIZATION
OF
GRAPHS
EMBEDDED
ON
SURFACES
H.
N.
DJIDJEV,
S.
M.
VENKATESAN
.
62
COMPLEXITY
AND
APPROXIMABILITY
OF
CERTAIN
BICRITERIA
LOCATION
PROBLEMS
S.
O.
KRUMKE,
H.
NOLTEMEIER,
S.
S.
RAVI,
M.
V.
MARATHE
.
73
ON
TERMINATION
OF
GRAPH
REWRITING
D.
PLUMP
.
88
A
UNIFORM
APPROACH
TO
GRAPH
REWRITING:
THE
PULLBACK
APPROACH
M.
BAUDERON
.
101
VISUALIZING
TWO
AND
THREE-DIMENSIONAL
MODELS
OF
MERISTEMATIC
GROWTH
F.
D.
FRACCHIA
.
116
GRAPH-THEORETICAL
METHODS
TO
CONSTRUCT
ENTITY-RELATIONSHIP
DATABASES
S.
HARTMANN
.
131
X
AN
APPROXIMATION
ALGORITHM
FOR
3-COLOURABILITY
I.
SCHIERMEYER
.
146
THE
MALLEABILITY
OF
TSPZOPT
S.
FISCHER,
L.
TORENVLIET
.
152
NON-OBLIVIOUS
LOCAL
SEARCH
FOR
GRAPH
AND
HYPERGRAPH
COLORING
PROBLEMS
P.
ALIMONTI
.
.
167
ON
INTERVAL
ROUTING
SCHEMES
AND
TREEWIDTH
H.
L.
BODLAENDER,
R.
B.
TAN,
D.
M.
THILIKOS,
J.
VAN
LEEUWEN
.
181
HIGHLY
FAULT-TOLERANT
ROUTINGS
AND
DIAMETER
VULNERABILITY
FOR
GENERALIZED
HYPERCUBE
GRAPHS
K.
WADA,
T.
IKEO,
K.
KAWAGUCHI,
W.
CHEN
.
197
HOT-POTATO
ROUTING
ON
MULTI-DIMENSIONAL
TORI
F.
MEYER
AUFDER
HEIDE,
M.
WESTERMANN
.
209
ON
DEVISING
BOOLEAN
ROUTING
SCHEMES
M.
FLAMMINI,
G.
GAMBOSI,
S.
SALOMONE
.
222
TOWARD
A
GENERAL
THEORY
OF
UNICAST-BASED
MULTICAST
COMMUNICATION
B.
D.
BIRCHLER,
A.-H.
ESFAHANIAN,
E.
TOR
NG
.
237
OPTIMAL
CUTWIDTHS
AND
BISECTION
WIDTHS
OF
2
AND
3-DIMENSIONAL
MESHES
J.
ROLIM,
O.
SY
KORA,
I.
VRFO
.
252
SEARCHING
FOR
FAULTY
LEAVES
IN
BINARY
TREES
P.DAMASCHKE
.
265
NC
ALGORITHMS
FOR
PARTITIONING
PLANAR
GRAPHS
INTO
INDUCED
FORESTS
AND
APPROXIMATING
NP-HARD
PROBLEMS
Z.-Z.CHEN,X.HE
.
275
EFFICIENT
PARALLEL
MODULAR
DECOMPOSITION
E.DAHLHAUS
.
290
XI
MODULAR
DECOMPOSITION
OF
HYPERGRAPHS
PBONIZZONI.G.
DELLA
VEDOVA
.
303
PARTITION
COEFFICIENTS
OF
ACYCLIC
GRAPHS
J.L.PFALTZ
.
318
SUB-CUBIC
COST
ALGORITHMS
FOR
THE
ALL
PAIRS
SHORTEST
PATH
PROBLEM
T
TAKAOKA
.
333
DIAMETRAL
PATH
GRAPHS
J.
S.
DEOGUN,
D.
KRATSCH
.
344
CHORDAL
GRAPHS
AND
THEIR
CLIQUE
GRAPHS
P.
GALINIER,
M.
HABIB,
C.
PAUL
.
358
A
COMPACT
DATA
STRUCTURE
AND
PARALLEL
ALGORITHMS
FOR
PERMUTATION
GRAPHS
J.
GUSTEDT,
M.
MORVAN,
L.
VIENNOT
.
372
HOMOGENEOUSLY
ORDERABLE
GRAPHS
AND
THE
STEINER
TREE
PROBLEM
A.
B
RANDS
TADT,
F.
F.
DRAGAN,
F.
NICOLAI
.
381
LIST
OF
PARTICIPANTS
.
397
AUTHORS
'
INDEX
.
403
LIST
OF
WG
PROCEEDINGS
.
405 |
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV010483951 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166 |
| callnumber-search | QA166 |
| callnumber-sort | QA 3166 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 276 |
| classification_tum | MAT 055f |
| ctrlnum | (OCoLC)33867342 (DE-599)BVBBV010483951 |
| dewey-full | 004.01 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.01 |
| dewey-search | 004.01 |
| dewey-sort | 14.01 |
| 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">BV010483951</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960130</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">951113s1995 gw ad|| |||| 10||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">945723474</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540606181</subfield><subfield code="9">3-540-60618-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)33867342</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010483951</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-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-83</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.01</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 276</subfield><subfield code="0">(DE-625)143642:</subfield><subfield code="2">rvk</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">27</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">28</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">21st international workshop, WG '95, Aachen, Germany, June 20 - 22, 1995 ; proceedings</subfield><subfield code="c">Manfred Nagl (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">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 406 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">1017</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphes, Théorie des - Congrès</subfield><subfield code="2">ram</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">coloration graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">décomposition graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">routage</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">réécriture</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie graphe</subfield><subfield code="2">inriac</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">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</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">1995</subfield><subfield code="z">Aachen</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="689" ind1="1" ind2="0"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nagl, Manfred</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">21</subfield><subfield code="d">1995</subfield><subfield code="c">Aachen</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)2150812-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">1017</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">1017</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=006986758&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006986758</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1995 Aachen gnd-content |
| genre_facet | Konferenzschrift 1995 Aachen |
| id | DE-604.BV010483951 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:06:16Z |
| institution | BVB |
| institution_GND | (DE-588)2150812-4 |
| isbn | 3540606181 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006986758 |
| oclc_num | 33867342 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-739 DE-384 DE-29T DE-19 DE-BY-UBM DE-20 DE-83 DE-11 DE-188 DE-706 |
| owner_facet | DE-91G DE-BY-TUM DE-739 DE-384 DE-29T DE-19 DE-BY-UBM DE-20 DE-83 DE-11 DE-188 DE-706 |
| physical | XI, 406 S. Ill., graph. Darst. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Graph theoretic concepts in computer science 21st international workshop, WG '95, Aachen, Germany, June 20 - 22, 1995 ; proceedings Manfred Nagl (ed.) Graph-theoretic concepts in computer science Berlin [u.a.] Springer 1995 XI, 406 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 1017 Algorithmes - Congrès Algorithmes - Congrès ram Graphes, Théorie des - Congrès Graphes, Théorie des - Congrès ram Informatique - Congrès coloration graphe inriac décomposition graphe inriac routage inriac réécriture inriac théorie graphe inriac Informatik Computer algorithms Congresses Computer science Congresses Graph theory Congresses Graphentheorie (DE-588)4113782-6 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1995 Aachen gnd-content Informatik (DE-588)4026894-9 s Graphentheorie (DE-588)4113782-6 s DE-604 Datenverarbeitung (DE-588)4011152-0 s 1\p DE-604 Nagl, Manfred Sonstige oth WG 21 1995 Aachen Sonstige (DE-588)2150812-4 oth Lecture notes in computer science 1017 (DE-604)BV000000607 1017 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006986758&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Graph theoretic concepts in computer science 21st international workshop, WG '95, Aachen, Germany, June 20 - 22, 1995 ; proceedings Lecture notes in computer science Algorithmes - Congrès Algorithmes - Congrès ram Graphes, Théorie des - Congrès Graphes, Théorie des - Congrès ram Informatique - Congrès coloration graphe inriac décomposition graphe inriac routage inriac réécriture inriac théorie graphe inriac Informatik Computer algorithms Congresses Computer science Congresses Graph theory Congresses Graphentheorie (DE-588)4113782-6 gnd Datenverarbeitung (DE-588)4011152-0 gnd Informatik (DE-588)4026894-9 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4011152-0 (DE-588)4026894-9 (DE-588)1071861417 |
| title | Graph theoretic concepts in computer science 21st international workshop, WG '95, Aachen, Germany, June 20 - 22, 1995 ; proceedings |
| title_alt | Graph-theoretic concepts in computer science |
| title_auth | Graph theoretic concepts in computer science 21st international workshop, WG '95, Aachen, Germany, June 20 - 22, 1995 ; proceedings |
| title_exact_search | Graph theoretic concepts in computer science 21st international workshop, WG '95, Aachen, Germany, June 20 - 22, 1995 ; proceedings |
| title_full | Graph theoretic concepts in computer science 21st international workshop, WG '95, Aachen, Germany, June 20 - 22, 1995 ; proceedings Manfred Nagl (ed.) |
| title_fullStr | Graph theoretic concepts in computer science 21st international workshop, WG '95, Aachen, Germany, June 20 - 22, 1995 ; proceedings Manfred Nagl (ed.) |
| title_full_unstemmed | Graph theoretic concepts in computer science 21st international workshop, WG '95, Aachen, Germany, June 20 - 22, 1995 ; proceedings Manfred Nagl (ed.) |
| title_short | Graph theoretic concepts in computer science |
| title_sort | graph theoretic concepts in computer science 21st international workshop wg 95 aachen germany june 20 22 1995 proceedings |
| title_sub | 21st international workshop, WG '95, Aachen, Germany, June 20 - 22, 1995 ; proceedings |
| topic | Algorithmes - Congrès Algorithmes - Congrès ram Graphes, Théorie des - Congrès Graphes, Théorie des - Congrès ram Informatique - Congrès coloration graphe inriac décomposition graphe inriac routage inriac réécriture inriac théorie graphe inriac Informatik Computer algorithms Congresses Computer science Congresses Graph theory Congresses Graphentheorie (DE-588)4113782-6 gnd Datenverarbeitung (DE-588)4011152-0 gnd Informatik (DE-588)4026894-9 gnd |
| topic_facet | Algorithmes - Congrès Graphes, Théorie des - Congrès Informatique - Congrès coloration graphe décomposition graphe routage réécriture théorie graphe Informatik Computer algorithms Congresses Computer science Congresses Graph theory Congresses Graphentheorie Datenverarbeitung Konferenzschrift 1995 Aachen |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006986758&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT naglmanfred graphtheoreticconceptsincomputerscience21stinternationalworkshopwg95aachengermanyjune20221995proceedings AT wgaachen graphtheoreticconceptsincomputerscience21stinternationalworkshopwg95aachengermanyjune20221995proceedings AT naglmanfred graphtheoreticconceptsincomputerscience AT wgaachen graphtheoreticconceptsincomputerscience |