Algorithms for drawing planar graphs

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Kant, Goossen (VerfasserIn)
Format: Buch
Sprache:Dutch
English
Veröffentlicht: 1993
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

MARC

LEADER 00000nam a2200000 c 4500
001 BV009035234
003 DE-604
005 00000000000000.0
007 t
008 940227s1993 m||| 00||| dut d
020 |a 9039304165  |9 90-393-0416-5 
035 |a (OCoLC)30687719 
035 |a (DE-599)BVBBV009035234 
040 |a DE-604  |b ger  |e rakddb 
041 0 |a dut  |a eng 
049 |a DE-29T  |a DE-739 
050 0 |a QA166 
100 1 |a Kant, Goossen  |e Verfasser  |4 aut 
245 1 0 |a Algorithms for drawing planar graphs  |c door Goossen Kant 
264 1 |c 1993 
300 |a X, 219 S. 
336 |b txt  |2 rdacontent 
337 |b n  |2 rdamedia 
338 |b nc  |2 rdacarrier 
500 |a Utrecht, Univ., Diss. - PST: Algoritmen voor het tekenen van planaire grafen 
650 7 |a Computergraphics  |2 gtt 
650 7 |a Grafen  |2 gtt 
650 7 |a Grafische methoden  |2 gtt 
650 4 |a Algorithms 
650 4 |a Graph theory 
650 0 7 |a Planarer Graph  |0 (DE-588)4174783-5  |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)4113937-9  |a Hochschulschrift  |2 gnd-content 
689 0 0 |a Planarer Graph  |0 (DE-588)4174783-5  |D s 
689 0 1 |a Algorithmus  |0 (DE-588)4001183-5  |D s 
689 0 |5 DE-604 
999 |a oai:aleph.bib-bvb.de:BVB01-005977690 

Datensatz im Suchindex

_version_ 1804123388758720512
any_adam_object
author Kant, Goossen
author_facet Kant, Goossen
author_role aut
author_sort Kant, Goossen
author_variant g k gk
building Verbundindex
bvnumber BV009035234
callnumber-first Q - Science
callnumber-label QA166
callnumber-raw QA166
callnumber-search QA166
callnumber-sort QA 3166
callnumber-subject QA - Mathematics
ctrlnum (OCoLC)30687719
(DE-599)BVBBV009035234
format Book
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01274nam a2200409 c 4500</leader><controlfield tag="001">BV009035234</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 m||| 00||| dut d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9039304165</subfield><subfield code="9">90-393-0416-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)30687719</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009035234</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">dut</subfield><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kant, Goossen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms for drawing planar graphs</subfield><subfield code="c">door Goossen Kant</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 219 S.</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="500" ind1=" " ind2=" "><subfield code="a">Utrecht, Univ., Diss. - PST: Algoritmen voor het tekenen van planaire grafen</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computergraphics</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafische methoden</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Planarer Graph</subfield><subfield code="0">(DE-588)4174783-5</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)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Planarer Graph</subfield><subfield code="0">(DE-588)4174783-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005977690</subfield></datafield></record></collection>
genre (DE-588)4113937-9 Hochschulschrift gnd-content
genre_facet Hochschulschrift
id DE-604.BV009035234
illustrated Not Illustrated
indexdate 2024-07-09T17:28:59Z
institution BVB
isbn 9039304165
language Dutch
English
oai_aleph_id oai:aleph.bib-bvb.de:BVB01-005977690
oclc_num 30687719
open_access_boolean
owner DE-29T
DE-739
owner_facet DE-29T
DE-739
physical X, 219 S.
publishDate 1993
publishDateSearch 1993
publishDateSort 1993
record_format marc
spelling Kant, Goossen Verfasser aut
Algorithms for drawing planar graphs door Goossen Kant
1993
X, 219 S.
txt rdacontent
n rdamedia
nc rdacarrier
Utrecht, Univ., Diss. - PST: Algoritmen voor het tekenen van planaire grafen
Computergraphics gtt
Grafen gtt
Grafische methoden gtt
Algorithms
Graph theory
Planarer Graph (DE-588)4174783-5 gnd rswk-swf
Algorithmus (DE-588)4001183-5 gnd rswk-swf
(DE-588)4113937-9 Hochschulschrift gnd-content
Planarer Graph (DE-588)4174783-5 s
Algorithmus (DE-588)4001183-5 s
DE-604
spellingShingle Kant, Goossen
Algorithms for drawing planar graphs
Computergraphics gtt
Grafen gtt
Grafische methoden gtt
Algorithms
Graph theory
Planarer Graph (DE-588)4174783-5 gnd
Algorithmus (DE-588)4001183-5 gnd
subject_GND (DE-588)4174783-5
(DE-588)4001183-5
(DE-588)4113937-9
title Algorithms for drawing planar graphs
title_auth Algorithms for drawing planar graphs
title_exact_search Algorithms for drawing planar graphs
title_full Algorithms for drawing planar graphs door Goossen Kant
title_fullStr Algorithms for drawing planar graphs door Goossen Kant
title_full_unstemmed Algorithms for drawing planar graphs door Goossen Kant
title_short Algorithms for drawing planar graphs
title_sort algorithms for drawing planar graphs
topic Computergraphics gtt
Grafen gtt
Grafische methoden gtt
Algorithms
Graph theory
Planarer Graph (DE-588)4174783-5 gnd
Algorithmus (DE-588)4001183-5 gnd
topic_facet Computergraphics
Grafen
Grafische methoden
Algorithms
Graph theory
Planarer Graph
Algorithmus
Hochschulschrift
work_keys_str_mv AT kantgoossen algorithmsfordrawingplanargraphs