Availability: Shortest edge-disjoint paths in graphs | Technische Universität München

Shortest edge-disjoint paths in graphs:

Saved in:

Bibliographic Details
Main Author:	Schwill, Andreas 1958- (Author)
Format:	Book
Language:	Undetermined
Published:	1990
Series:	Universität <Oldenburg> / Fachbereich Informatik: Berichte aus dem Fachbereich Informatik der Universität Oldenburg 1990,1
Subjects:	Graph Extremalproblem Pfad > Mathematik Hochschulschrift Kantenweg Injektiver Pfad Minimaler Pfad
Item Description:	Zugl.: Oldenburg, Univ., Diss., 1990
Physical Description:	80 S. graph. Darst.

Staff View

MARC


LEADER	00000nam a2200000 cb4500
001	BV004173508
003	DE-604
005	19910712
007	t\|
008	901212s1990 xx d\|\|\| m\|\|\| 00\|\|\| und d
035			\|a (OCoLC)246849458
035			\|a (DE-599)BVBBV004173508
040			\|a DE-604 \|b ger \|e rakddb
041			\|a und
049			\|a DE-91G \|a DE-12 \|a DE-739 \|a DE-355 \|a DE-29T
084			\|a DAT 537d \|2 stub
084			\|a MAT 055d \|2 stub
100	1		\|a Schwill, Andreas \|d 1958- \|e Verfasser \|0 (DE-588)13258834X \|4 aut
245	1	0	\|a Shortest edge-disjoint paths in graphs \|c von Andreas Schwill
264		1	\|c 1990
300			\|a 80 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a Universität <Oldenburg> / Fachbereich Informatik: Berichte aus dem Fachbereich Informatik der Universität Oldenburg \|v 1990,1
500			\|a Zugl.: Oldenburg, Univ., Diss., 1990
650	0	7	\|a Graph \|0 (DE-588)4021842-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Extremalproblem \|0 (DE-588)4439315-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Pfad \|g Mathematik \|0 (DE-588)4507234-6 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)4113937-9 \|a Hochschulschrift \|2 gnd-content
655		7	\|a Kantenweg \|2 gnd \|9 rswk-swf
655		7	\|a Injektiver Pfad \|2 gnd \|9 rswk-swf
655		7	\|a Minimaler Pfad \|2 gnd \|9 rswk-swf
689	0	0	\|a Minimaler Pfad \|A f
689	0	1	\|a Graph \|0 (DE-588)4021842-9 \|D s
689	0		\|5 DE-604
689	1	0	\|a Injektiver Pfad \|A f
689	1	1	\|a Graph \|0 (DE-588)4021842-9 \|D s
689	1		\|5 DE-604
689	2	0	\|a Graph \|0 (DE-588)4021842-9 \|D s
689	2	1	\|a Pfad \|g Mathematik \|0 (DE-588)4507234-6 \|D s
689	2	2	\|a Extremalproblem \|0 (DE-588)4439315-5 \|D s
689	2		\|5 DE-604
689	3	0	\|a Graph \|0 (DE-588)4021842-9 \|D s
689	3	1	\|a Kantenweg \|A f
689	3		\|5 DE-604
810	2		\|a Fachbereich Informatik: Berichte aus dem Fachbereich Informatik der Universität Oldenburg \|t Universität <Oldenburg> \|v 1990,1 \|w (DE-604)BV000900143 \|9 1990,1
943	1		\|a oai:aleph.bib-bvb.de:BVB01-002602001

Record in the Search Index

DE-BY-TUM_call_number	0102 DAT 001z 2001 A 993-1990,1
DE-BY-TUM_katkey	509428
DE-BY-TUM_location	01
DE-BY-TUM_media_number	040010250738
_version_	1821939028441694208
adam_text
any_adam_object
author	Schwill, Andreas 1958-
author_GND	(DE-588)13258834X
author_facet	Schwill, Andreas 1958-
author_role	aut
author_sort	Schwill, Andreas 1958-
author_variant	a s as
building	Verbundindex
bvnumber	BV004173508
classification_rvk	SS 5560
classification_tum	DAT 537d MAT 055d
ctrlnum	(OCoLC)246849458 (DE-599)BVBBV004173508
discipline	Informatik Mathematik
format	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">BV004173508</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19910712</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">901212s1990 xx d\|\|\| m\|\|\| 00\|\|\| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)246849458</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004173508</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schwill, Andreas</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)13258834X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Shortest edge-disjoint paths in graphs</subfield><subfield code="c">von Andreas Schwill</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">80 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">Universität <Oldenburg> / Fachbereich Informatik: Berichte aus dem Fachbereich Informatik der Universität Oldenburg</subfield><subfield code="v">1990,1</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Oldenburg, Univ., Diss., 1990</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">Extremalproblem</subfield><subfield code="0">(DE-588)4439315-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Pfad</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4507234-6</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="655" ind1=" " ind2="7"><subfield code="a">Kantenweg</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Injektiver Pfad</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Minimaler Pfad</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Minimaler Pfad</subfield><subfield code="A">f</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</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">Injektiver Pfad</subfield><subfield code="A">f</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</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">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Pfad</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4507234-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">Extremalproblem</subfield><subfield code="0">(DE-588)4439315-5</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">Kantenweg</subfield><subfield code="A">f</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fachbereich Informatik: Berichte aus dem Fachbereich Informatik der Universität Oldenburg</subfield><subfield code="t">Universität <Oldenburg></subfield><subfield code="v">1990,1</subfield><subfield code="w">(DE-604)BV000900143</subfield><subfield code="9">1990,1</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002602001</subfield></datafield></record></collection>
genre	(DE-588)4113937-9 Hochschulschrift gnd-content Kantenweg gnd Injektiver Pfad gnd Minimaler Pfad gnd
genre_facet	Hochschulschrift Kantenweg Injektiver Pfad Minimaler Pfad
id	DE-604.BV004173508
illustrated	Illustrated
indexdate	2025-01-11T18:56:10Z
institution	BVB
language	Undetermined
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-002602001
oclc_num	246849458
open_access_boolean
owner	DE-91G DE-BY-TUM DE-12 DE-739 DE-355 DE-BY-UBR DE-29T
owner_facet	DE-91G DE-BY-TUM DE-12 DE-739 DE-355 DE-BY-UBR DE-29T
physical	80 S. graph. Darst.
publishDate	1990
publishDateSearch	1990
publishDateSort	1990
record_format	marc
series2	Universität <Oldenburg> / Fachbereich Informatik: Berichte aus dem Fachbereich Informatik der Universität Oldenburg
spellingShingle	Schwill, Andreas 1958- Shortest edge-disjoint paths in graphs Graph (DE-588)4021842-9 gnd Extremalproblem (DE-588)4439315-5 gnd Pfad Mathematik (DE-588)4507234-6 gnd
subject_GND	(DE-588)4021842-9 (DE-588)4439315-5 (DE-588)4507234-6 (DE-588)4113937-9
title	Shortest edge-disjoint paths in graphs
title_auth	Shortest edge-disjoint paths in graphs
title_exact_search	Shortest edge-disjoint paths in graphs
title_full	Shortest edge-disjoint paths in graphs von Andreas Schwill
title_fullStr	Shortest edge-disjoint paths in graphs von Andreas Schwill
title_full_unstemmed	Shortest edge-disjoint paths in graphs von Andreas Schwill
title_short	Shortest edge-disjoint paths in graphs
title_sort	shortest edge disjoint paths in graphs
topic	Graph (DE-588)4021842-9 gnd Extremalproblem (DE-588)4439315-5 gnd Pfad Mathematik (DE-588)4507234-6 gnd
topic_facet	Graph Extremalproblem Pfad Mathematik Hochschulschrift Kantenweg Injektiver Pfad Minimaler Pfad
volume_link	(DE-604)BV000900143
work_keys_str_mv	AT schwillandreas shortestedgedisjointpathsingraphs

Availability

Order (Login required)

Order paper/chapter scan

Branch Library Mathematics & Informatics

Holdings details from Teilbibliothek Mathematik & Informatik
Call Number:	0102 DAT 001z 2001 A 993-1990,1 Floor plan
Copy 1	Available for loan On Shelf