COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem

Gespeichert in:

Autor*in:	Andrews, M. [verfasserIn] Zhang, L.

Format:	Artikel

Erschienen:	2006

Systematik:	SA 3010

Umfang:	17

Übergeordnetes Werk:	Enthalten in: Journal of the ACM - New York, NY : Assoc., 1954, 53(2006), 5, Seite 745-761
Übergeordnetes Werk:	volume:53 ; year:2006 ; number:5 ; pages:745-761 ; extent:17

Katalog-ID:	OLC1756594694

Internformat


LEADER	01000caa a22002652 4500
001	OLC1756594694
003	DE-627
005	20220215131124.0
007	tu
008	070105s2006 xx \|\|\|\|\| 00\| \|\|und c
028	5	2	\|a sw070105
035			\|a (DE-627)OLC1756594694
035			\|a (DE-599)GBVOLC1756594694
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
082	0	4	\|a 004
084			\|a SA 3010 \|q AVZ \|2 rvk
084			\|a 54.00 \|2 bkl
100	1		\|a Andrews, M. \|e verfasserin \|4 aut
245	1	0	\|a COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem
264		1	\|c 2006
300			\|a 17
336			\|a Text \|b txt \|2 rdacontent
337			\|a ohne Hilfsmittel zu benutzen \|b n \|2 rdamedia
338			\|a Band \|b nc \|2 rdacarrier
700	1		\|a Zhang, L. \|4 oth
773	0	8	\|i Enthalten in \|t Journal of the ACM \|d New York, NY : Assoc., 1954 \|g 53(2006), 5, Seite 745-761 \|w (DE-627)12909241X \|w (DE-600)6759-3 \|w (DE-576)014427982 \|x 0004-5411 \|7 nnns
773	1	8	\|g volume:53 \|g year:2006 \|g number:5 \|g pages:745-761 \|g extent:17
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-MAT
912			\|a GBV_ILN_21
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_30
912			\|a GBV_ILN_31
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_130
912			\|a GBV_ILN_2012
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2027
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4247
912			\|a GBV_ILN_4266
912			\|a GBV_ILN_4310
912			\|a GBV_ILN_4317
912			\|a GBV_ILN_4318
936	r	v	\|a SA 3010
936	b	k	\|a 54.00 \|q AVZ
951			\|a AR
952			\|d 53 \|j 2006 \|e 5 \|h 745-761 \|g 17

Indexfelder

author_variant	m a ma
matchkey_str	article:00045411:2006----::opttoacmlxtlgrtmcadesfhudrceeg
hierarchy_sort_str	2006
bklnumber	54.00
publishDate	2006
allfields	sw070105 (DE-627)OLC1756594694 (DE-599)GBVOLC1756594694 DE-627 ger DE-627 rakwb 004 SA 3010 AVZ rvk 54.00 bkl Andrews, M. verfasserin aut COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem 2006 17 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Zhang, L. oth Enthalten in Journal of the ACM New York, NY : Assoc., 1954 53(2006), 5, Seite 745-761 (DE-627)12909241X (DE-600)6759-3 (DE-576)014427982 0004-5411 nnns volume:53 year:2006 number:5 pages:745-761 extent:17 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_69 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2012 GBV_ILN_2021 GBV_ILN_2027 GBV_ILN_2190 GBV_ILN_4125 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4310 GBV_ILN_4317 GBV_ILN_4318 SA 3010 54.00 AVZ AR 53 2006 5 745-761 17
spelling	sw070105 (DE-627)OLC1756594694 (DE-599)GBVOLC1756594694 DE-627 ger DE-627 rakwb 004 SA 3010 AVZ rvk 54.00 bkl Andrews, M. verfasserin aut COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem 2006 17 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Zhang, L. oth Enthalten in Journal of the ACM New York, NY : Assoc., 1954 53(2006), 5, Seite 745-761 (DE-627)12909241X (DE-600)6759-3 (DE-576)014427982 0004-5411 nnns volume:53 year:2006 number:5 pages:745-761 extent:17 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_69 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2012 GBV_ILN_2021 GBV_ILN_2027 GBV_ILN_2190 GBV_ILN_4125 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4310 GBV_ILN_4317 GBV_ILN_4318 SA 3010 54.00 AVZ AR 53 2006 5 745-761 17
allfields_unstemmed	sw070105 (DE-627)OLC1756594694 (DE-599)GBVOLC1756594694 DE-627 ger DE-627 rakwb 004 SA 3010 AVZ rvk 54.00 bkl Andrews, M. verfasserin aut COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem 2006 17 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Zhang, L. oth Enthalten in Journal of the ACM New York, NY : Assoc., 1954 53(2006), 5, Seite 745-761 (DE-627)12909241X (DE-600)6759-3 (DE-576)014427982 0004-5411 nnns volume:53 year:2006 number:5 pages:745-761 extent:17 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_69 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2012 GBV_ILN_2021 GBV_ILN_2027 GBV_ILN_2190 GBV_ILN_4125 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4310 GBV_ILN_4317 GBV_ILN_4318 SA 3010 54.00 AVZ AR 53 2006 5 745-761 17
allfieldsGer	sw070105 (DE-627)OLC1756594694 (DE-599)GBVOLC1756594694 DE-627 ger DE-627 rakwb 004 SA 3010 AVZ rvk 54.00 bkl Andrews, M. verfasserin aut COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem 2006 17 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Zhang, L. oth Enthalten in Journal of the ACM New York, NY : Assoc., 1954 53(2006), 5, Seite 745-761 (DE-627)12909241X (DE-600)6759-3 (DE-576)014427982 0004-5411 nnns volume:53 year:2006 number:5 pages:745-761 extent:17 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_69 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2012 GBV_ILN_2021 GBV_ILN_2027 GBV_ILN_2190 GBV_ILN_4125 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4310 GBV_ILN_4317 GBV_ILN_4318 SA 3010 54.00 AVZ AR 53 2006 5 745-761 17
allfieldsSound	sw070105 (DE-627)OLC1756594694 (DE-599)GBVOLC1756594694 DE-627 ger DE-627 rakwb 004 SA 3010 AVZ rvk 54.00 bkl Andrews, M. verfasserin aut COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem 2006 17 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Zhang, L. oth Enthalten in Journal of the ACM New York, NY : Assoc., 1954 53(2006), 5, Seite 745-761 (DE-627)12909241X (DE-600)6759-3 (DE-576)014427982 0004-5411 nnns volume:53 year:2006 number:5 pages:745-761 extent:17 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_69 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2012 GBV_ILN_2021 GBV_ILN_2027 GBV_ILN_2190 GBV_ILN_4125 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4310 GBV_ILN_4317 GBV_ILN_4318 SA 3010 54.00 AVZ AR 53 2006 5 745-761 17
source	Enthalten in Journal of the ACM 53(2006), 5, Seite 745-761 volume:53 year:2006 number:5 pages:745-761 extent:17
sourceStr	Enthalten in Journal of the ACM 53(2006), 5, Seite 745-761 volume:53 year:2006 number:5 pages:745-761 extent:17
format_phy_str_mv	Article
institution	findex.gbv.de
dewey-raw	004
isfreeaccess_bool	false
container_title	Journal of the ACM
authorswithroles_txt_mv	Andrews, M. @@aut@@ Zhang, L. @@oth@@
publishDateDaySort_date	2006-01-01T00:00:00Z
hierarchy_top_id	12909241X
dewey-sort	14
id	OLC1756594694
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC1756594694</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220215131124.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">070105s2006 xx \|\|\|\|\| 00\| \|\|und c</controlfield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">sw070105</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1756594694</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1756594694</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 3010</subfield><subfield code="q">AVZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Andrews, M.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, L.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of the ACM</subfield><subfield code="d">New York, NY : Assoc., 1954</subfield><subfield code="g">53(2006), 5, Seite 745-761</subfield><subfield code="w">(DE-627)12909241X</subfield><subfield code="w">(DE-600)6759-3</subfield><subfield code="w">(DE-576)014427982</subfield><subfield code="x">0004-5411</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:53</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:5</subfield><subfield code="g">pages:745-761</subfield><subfield code="g">extent:17</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4247</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4310</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 3010</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">53</subfield><subfield code="j">2006</subfield><subfield code="e">5</subfield><subfield code="h">745-761</subfield><subfield code="g">17</subfield></datafield></record></collection>
author	Andrews, M.
spellingShingle	Andrews, M. ddc 004 rvk SA 3010 bkl 54.00 COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem
authorStr	Andrews, M.
ppnlink_with_tag_str_mv	@@773@@(DE-627)12909241X
format	Article
dewey-ones	004 - Data processing & computer science
delete_txt_mv	keep
author_role	aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	0004-5411
topic_title	004 SA 3010 AVZ rvk 54.00 bkl COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem
topic	ddc 004 rvk SA 3010 bkl 54.00
topic_unstemmed	ddc 004 rvk SA 3010 bkl 54.00
topic_browse	ddc 004 rvk SA 3010 bkl 54.00
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
author2_variant	l z lz
hierarchy_parent_title	Journal of the ACM
hierarchy_parent_id	12909241X
dewey-tens	000 - Computer science, knowledge & systems
hierarchy_top_title	Journal of the ACM
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)12909241X (DE-600)6759-3 (DE-576)014427982
title	COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem
ctrlnum	(DE-627)OLC1756594694 (DE-599)GBVOLC1756594694
title_full	COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem
author_sort	Andrews, M.
journal	Journal of the ACM
journalStr	Journal of the ACM
isOA_bool	false
dewey-hundreds	000 - Computer science, information & general works
recordtype	marc
publishDateSort	2006
contenttype_str_mv	txt
container_start_page	745
author_browse	Andrews, M.
container_volume	53
physical	17
class	004 SA 3010 AVZ rvk 54.00 bkl
format_se	Aufsätze
author-letter	Andrews, M.
dewey-full	004
title_sort	computational complexity - logarithmic hardness of the undirected edge-disjoint paths problem
title_auth	COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_69 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2012 GBV_ILN_2021 GBV_ILN_2027 GBV_ILN_2190 GBV_ILN_4125 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4310 GBV_ILN_4317 GBV_ILN_4318
container_issue	5
title_short	COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem
remote_bool	false
author2	Zhang, L.
author2Str	Zhang, L.
ppnlink	12909241X
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
author2_role	oth
up_date	2024-07-04T00:49:07.153Z
_version_	1803607497406152704
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC1756594694</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220215131124.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">070105s2006 xx \|\|\|\|\| 00\| \|\|und c</controlfield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">sw070105</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1756594694</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1756594694</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 3010</subfield><subfield code="q">AVZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Andrews, M.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, L.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of the ACM</subfield><subfield code="d">New York, NY : Assoc., 1954</subfield><subfield code="g">53(2006), 5, Seite 745-761</subfield><subfield code="w">(DE-627)12909241X</subfield><subfield code="w">(DE-600)6759-3</subfield><subfield code="w">(DE-576)014427982</subfield><subfield code="x">0004-5411</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:53</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:5</subfield><subfield code="g">pages:745-761</subfield><subfield code="g">extent:17</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4247</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4310</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 3010</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">53</subfield><subfield code="j">2006</subfield><subfield code="e">5</subfield><subfield code="h">745-761</subfield><subfield code="g">17</subfield></datafield></record></collection>
score	7.4010077

Nicht das Richtige dabei?

Schreiben Sie uns!

COMPUTATIONAL COMPLEXITY - Logarithmic Hardness of the Undirected Edge-Disjoint Paths Problem

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?