Algorithms and computation: 8th international workshop, WALCOM 2014, Chennaia,India, February 13 - 15, 2014 ; proceedings
Gespeichert in:
Format: | Elektronisch Tagungsbericht E-Book |
---|---|
Sprache: | English |
Veröffentlicht: |
Cham [u.a.]
Springer
2014
|
Schriftenreihe: | Lecture notes in computer science
8344 |
Schlagworte: | |
Online-Zugang: | DE-634 DE-Aug4 DE-M347 DE-92 DE-859 DE-861 DE-91 DE-384 DE-473 DE-703 DE-20 DE-706 DE-29 DE-739 Volltext |
Beschreibung: | 1 Online-Ressource (XIII, 362 S.) graph. Darst. |
ISBN: | 9783319046563 9783319046570 |
DOI: | 10.1007/978-3-319-04657-0 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV041775084 | ||
003 | DE-604 | ||
007 | cr|uuu---uuuuu | ||
008 | 140403s2014 xx d||| o|||| 10||| eng d | ||
020 | |a 9783319046563 |9 978-3-319-04656-3 | ||
020 | |a 9783319046570 |c eISBN |9 978-3-319-04657-0 | ||
024 | 7 | |a 10.1007/978-3-319-04657-0 |2 doi | |
035 | |a (OCoLC)869715484 | ||
035 | |a (DE-599)BVBBV041775084 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-473 |a DE-20 |a DE-91 |a DE-706 |a DE-739 |a DE-384 |a DE-M347 |a DE-703 |a DE-29 |a DE-92 |a DE-Aug4 |a DE-859 |a DE-861 |a DE-634 | ||
082 | 0 | |a 005.1 | |
084 | |a DAT 530f |2 stub | ||
245 | 1 | 0 | |a Algorithms and computation |b 8th international workshop, WALCOM 2014, Chennaia,India, February 13 - 15, 2014 ; proceedings |c Sudebkumar Prasant Pal ... (eds.) |
264 | 1 | |a Cham [u.a.] |b Springer |c 2014 | |
300 | |a 1 Online-Ressource (XIII, 362 S.) |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 1 | |a Lecture notes in computer science |v 8344 | |
650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Graphenzeichnen |0 (DE-588)4706480-8 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2013 |z Kharagpur West Bengal |2 gnd-content | |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2014 |z Chennai |2 gnd-content | |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | 1 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Graphenzeichnen |0 (DE-588)4706480-8 |D s |
689 | 2 | |5 DE-604 | |
689 | 3 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
689 | 3 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 3 | |5 DE-604 | |
689 | 4 | 0 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
689 | 4 | |5 DE-604 | |
700 | 1 | |a Pal, Sudebkumar Prasant |e Sonstige |0 (DE-588)1047744422 |4 oth | |
711 | 2 | |a WALCOM |n 8 |d 2014 |c Chennai |j Sonstige |0 (DE-588)1047744058 |4 oth | |
830 | 0 | |a Lecture notes in computer science |v 8344 |w (DE-604)BV014880109 |9 8344 | |
856 | 4 | 0 | |u https://doi.org/10.1007/978-3-319-04657-0 |x Verlag |3 Volltext |
912 | |a ZDB-2-LNC | ||
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-027220996 | |
966 | e | |u https://doi.org/10.1007/978-3-319-04657-0 |l DE-634 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-04657-0 |l DE-Aug4 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-04657-0 |l DE-M347 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-04657-0 |l DE-92 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-04657-0 |l DE-859 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-04657-0 |l DE-861 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-04657-0 |l DE-91 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-04657-0 |l DE-384 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-04657-0 |l DE-473 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-04657-0 |l DE-703 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-04657-0 |l DE-20 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-04657-0 |l DE-706 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-04657-0 |l DE-29 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-319-04657-0 |l DE-739 |p ZDB-2-LNC |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1820875568629940224 |
---|---|
adam_text | |
any_adam_object | |
author_GND | (DE-588)1047744422 |
building | Verbundindex |
bvnumber | BV041775084 |
classification_rvk | SS 4800 |
classification_tum | DAT 530f |
collection | ZDB-2-LNC |
ctrlnum | (OCoLC)869715484 (DE-599)BVBBV041775084 |
dewey-full | 005.1 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.1 |
dewey-search | 005.1 |
dewey-sort | 15.1 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
doi_str_mv | 10.1007/978-3-319-04657-0 |
format | Electronic Conference Proceeding eBook |
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">BV041775084</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">140403s2014 xx d||| o|||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319046563</subfield><subfield code="9">978-3-319-04656-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319046570</subfield><subfield code="c">eISBN</subfield><subfield code="9">978-3-319-04657-0</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-319-04657-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)869715484</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV041775084</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-473</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and computation</subfield><subfield code="b">8th international workshop, WALCOM 2014, Chennaia,India, February 13 - 15, 2014 ; proceedings</subfield><subfield code="c">Sudebkumar Prasant Pal ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIII, 362 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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</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">8344</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-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">2013</subfield><subfield code="z">Kharagpur West Bengal</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2014</subfield><subfield code="z">Chennai</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</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">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pal, Sudebkumar Prasant</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1047744422</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">WALCOM</subfield><subfield code="n">8</subfield><subfield code="d">2014</subfield><subfield code="c">Chennai</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1047744058</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">8344</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">8344</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027220996</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="l">DE-634</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="l">DE-Aug4</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="l">DE-M347</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="l">DE-92</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="l">DE-859</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="l">DE-861</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="l">DE-384</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="l">DE-473</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="l">DE-703</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="l">DE-20</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="l">DE-706</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="l">DE-29</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-04657-0</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 2013 Kharagpur West Bengal gnd-content (DE-588)1071861417 Konferenzschrift 2014 Chennai gnd-content |
genre_facet | Konferenzschrift 2013 Kharagpur West Bengal Konferenzschrift 2014 Chennai |
id | DE-604.BV041775084 |
illustrated | Illustrated |
indexdate | 2025-01-10T15:17:42Z |
institution | BVB |
institution_GND | (DE-588)1047744058 |
isbn | 9783319046563 9783319046570 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027220996 |
oclc_num | 869715484 |
open_access_boolean | |
owner | DE-473 DE-BY-UBG DE-20 DE-91 DE-BY-TUM DE-706 DE-739 DE-384 DE-M347 DE-703 DE-29 DE-92 DE-Aug4 DE-859 DE-861 DE-634 |
owner_facet | DE-473 DE-BY-UBG DE-20 DE-91 DE-BY-TUM DE-706 DE-739 DE-384 DE-M347 DE-703 DE-29 DE-92 DE-Aug4 DE-859 DE-861 DE-634 |
physical | 1 Online-Ressource (XIII, 362 S.) graph. Darst. |
psigel | ZDB-2-LNC |
publishDate | 2014 |
publishDateSearch | 2014 |
publishDateSort | 2014 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | Algorithms and computation 8th international workshop, WALCOM 2014, Chennaia,India, February 13 - 15, 2014 ; proceedings Sudebkumar Prasant Pal ... (eds.) Cham [u.a.] Springer 2014 1 Online-Ressource (XIII, 362 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 8344 Graph (DE-588)4021842-9 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Graphenzeichnen (DE-588)4706480-8 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2013 Kharagpur West Bengal gnd-content (DE-588)1071861417 Konferenzschrift 2014 Chennai gnd-content Algorithmus (DE-588)4001183-5 s Berechnungskomplexität (DE-588)4134751-1 s DE-604 Approximationsalgorithmus (DE-588)4500954-5 s Graphenzeichnen (DE-588)4706480-8 s Graph (DE-588)4021842-9 s Algorithmische Geometrie (DE-588)4130267-9 s Pal, Sudebkumar Prasant Sonstige (DE-588)1047744422 oth WALCOM 8 2014 Chennai Sonstige (DE-588)1047744058 oth Lecture notes in computer science 8344 (DE-604)BV014880109 8344 https://doi.org/10.1007/978-3-319-04657-0 Verlag Volltext |
spellingShingle | Algorithms and computation 8th international workshop, WALCOM 2014, Chennaia,India, February 13 - 15, 2014 ; proceedings Lecture notes in computer science Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphenzeichnen (DE-588)4706480-8 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4021842-9 (DE-588)4500954-5 (DE-588)4130267-9 (DE-588)4706480-8 (DE-588)4134751-1 (DE-588)4001183-5 (DE-588)1071861417 |
title | Algorithms and computation 8th international workshop, WALCOM 2014, Chennaia,India, February 13 - 15, 2014 ; proceedings |
title_auth | Algorithms and computation 8th international workshop, WALCOM 2014, Chennaia,India, February 13 - 15, 2014 ; proceedings |
title_exact_search | Algorithms and computation 8th international workshop, WALCOM 2014, Chennaia,India, February 13 - 15, 2014 ; proceedings |
title_full | Algorithms and computation 8th international workshop, WALCOM 2014, Chennaia,India, February 13 - 15, 2014 ; proceedings Sudebkumar Prasant Pal ... (eds.) |
title_fullStr | Algorithms and computation 8th international workshop, WALCOM 2014, Chennaia,India, February 13 - 15, 2014 ; proceedings Sudebkumar Prasant Pal ... (eds.) |
title_full_unstemmed | Algorithms and computation 8th international workshop, WALCOM 2014, Chennaia,India, February 13 - 15, 2014 ; proceedings Sudebkumar Prasant Pal ... (eds.) |
title_short | Algorithms and computation |
title_sort | algorithms and computation 8th international workshop walcom 2014 chennaia india february 13 15 2014 proceedings |
title_sub | 8th international workshop, WALCOM 2014, Chennaia,India, February 13 - 15, 2014 ; proceedings |
topic | Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphenzeichnen (DE-588)4706480-8 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Graph Approximationsalgorithmus Algorithmische Geometrie Graphenzeichnen Berechnungskomplexität Algorithmus Konferenzschrift 2013 Kharagpur West Bengal Konferenzschrift 2014 Chennai |
url | https://doi.org/10.1007/978-3-319-04657-0 |
volume_link | (DE-604)BV014880109 |
work_keys_str_mv | AT palsudebkumarprasant algorithmsandcomputation8thinternationalworkshopwalcom2014chennaiaindiafebruary13152014proceedings AT walcomchennai algorithmsandcomputation8thinternationalworkshopwalcom2014chennaiaindiafebruary13152014proceedings |