A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Bonn
Forschungsinst. für Diskrete Mathematik
[2006]
|
| Schriftenreihe: | Report
06964 |
| Beschreibung: | 18 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV036017979 | ||
| 003 | DE-604 | ||
| 005 | 20160308 | ||
| 007 | t | ||
| 008 | 100209s2006 d||| |||| 00||| eng d | ||
| 016 | 7 | |a 984439617 |2 DE-101 | |
| 035 | |a (OCoLC)184695273 | ||
| 035 | |a (DE-599)DNB984439617 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 | ||
| 082 | 0 | |a 621.395 |2 22/ger | |
| 084 | |a 620 |2 sdnb | ||
| 100 | 1 | |a Peyer, Sven |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing |c Sven Peyer ; Jens Vygen ; Dieter Rautenbach |
| 264 | 1 | |a Bonn |b Forschungsinst. für Diskrete Mathematik |c [2006] | |
| 300 | |a 18 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Report |v 06964 | |
| 700 | 1 | |a Vygen, Jens |d 1967- |e Verfasser |0 (DE-588)14204086X |4 aut | |
| 700 | 1 | |a Rautenbach, Dieter |d 1972- |e Verfasser |0 (DE-588)123884292 |4 aut | |
| 830 | 0 | |a Report |v 06964 |w (DE-604)BV025500002 |9 06964 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-018910161 | ||
Datensatz im Suchindex
| _version_ | 1804141044437090304 |
|---|---|
| any_adam_object | |
| author | Peyer, Sven Vygen, Jens 1967- Rautenbach, Dieter 1972- |
| author_GND | (DE-588)14204086X (DE-588)123884292 |
| author_facet | Peyer, Sven Vygen, Jens 1967- Rautenbach, Dieter 1972- |
| author_role | aut aut aut |
| author_sort | Peyer, Sven |
| author_variant | s p sp j v jv d r dr |
| building | Verbundindex |
| bvnumber | BV036017979 |
| ctrlnum | (OCoLC)184695273 (DE-599)DNB984439617 |
| dewey-full | 621.395 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 621 - Applied physics |
| dewey-raw | 621.395 |
| dewey-search | 621.395 |
| dewey-sort | 3621.395 |
| dewey-tens | 620 - Engineering and allied operations |
| discipline | Maschinenbau / Maschinenwesen Elektrotechnik / Elektronik / Nachrichtentechnik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01090nam a2200325 cb4500</leader><controlfield tag="001">BV036017979</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160308 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100209s2006 d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">984439617</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)184695273</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB984439617</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-11</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">621.395</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">620</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Peyer, Sven</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing</subfield><subfield code="c">Sven Peyer ; Jens Vygen ; Dieter Rautenbach</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bonn</subfield><subfield code="b">Forschungsinst. für Diskrete Mathematik</subfield><subfield code="c">[2006]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18 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">Report</subfield><subfield code="v">06964</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vygen, Jens</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)14204086X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rautenbach, Dieter</subfield><subfield code="d">1972-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123884292</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Report</subfield><subfield code="v">06964</subfield><subfield code="w">(DE-604)BV025500002</subfield><subfield code="9">06964</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018910161</subfield></datafield></record></collection> |
| id | DE-604.BV036017979 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:09:37Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018910161 |
| oclc_num | 184695273 |
| open_access_boolean | |
| owner | DE-11 |
| owner_facet | DE-11 |
| physical | 18 S. graph. Darst. |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | Forschungsinst. für Diskrete Mathematik |
| record_format | marc |
| series | Report |
| series2 | Report |
| spelling | Peyer, Sven Verfasser aut A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing Sven Peyer ; Jens Vygen ; Dieter Rautenbach Bonn Forschungsinst. für Diskrete Mathematik [2006] 18 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Report 06964 Vygen, Jens 1967- Verfasser (DE-588)14204086X aut Rautenbach, Dieter 1972- Verfasser (DE-588)123884292 aut Report 06964 (DE-604)BV025500002 06964 |
| spellingShingle | Peyer, Sven Vygen, Jens 1967- Rautenbach, Dieter 1972- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing Report |
| title | A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing |
| title_auth | A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing |
| title_exact_search | A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing |
| title_full | A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing Sven Peyer ; Jens Vygen ; Dieter Rautenbach |
| title_fullStr | A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing Sven Peyer ; Jens Vygen ; Dieter Rautenbach |
| title_full_unstemmed | A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing Sven Peyer ; Jens Vygen ; Dieter Rautenbach |
| title_short | A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing |
| title_sort | a generalization of dijkstra s shortest path algorithm with applications to vlsi routing |
| volume_link | (DE-604)BV025500002 |
| work_keys_str_mv | AT peyersven ageneralizationofdijkstrasshortestpathalgorithmwithapplicationstovlsirouting AT vygenjens ageneralizationofdijkstrasshortestpathalgorithmwithapplicationstovlsirouting AT rautenbachdieter ageneralizationofdijkstrasshortestpathalgorithmwithapplicationstovlsirouting |