Tools

LEADER 05022cam a2201069 a 4500

001 ocm48186793;

003 OCoLC;

005 20260420152354.0;

008 011019s2001 gw a b 101 0 engod;

010 a| 2001055114;

015 a| 01,N42,03682| dnb;

016 7 a| 9627160812| DE-101;

019 a| 639952541a| 786797437a| 960129624a| 1066917077a| 1084931876a| 1225683936;

020 a| 3540427074q| (pbk.);

020 a| 9783540427070q| (pbk.);

024 3 a| 9783540427070;

029 0 a| OHXb| har015031967;

029 1 a| AU@b| 000023253177;

029 1 a| DEBBGb| BV013952749;

029 1 a| DEBSZb| 094987734;

029 1 a| NLGGCb| 234997818;

029 1 a| NZ1b| 6569852;

029 1 a| YDXCPb| 1833274;

035 a| (Sirsi) o48186793;

049 a| EREE;

050 4 a| QA166b| .G7172 2001;

055 3 a| QA75b| .L38 no.2204;

072 7 a| QA2| lcco;

080 a| 519.17-37;

082 04 a| 001.64b| L497, v.22042| 21;

084 a| G.2.22| acmccs;

084 a| 54.102| bcl;

084 a| SS 48002| rvk;

084 a| MAT 055f2| stub;

090 a| QA75.5b| .I58 2001;

111 2 a| International Workshop WGn| (27th :d| 2001 :c| Boltenhagen, Germany)=| ^A1216366;

245 10 a| Graph-theoretic concepts in computer science :b| 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 : proceedings /c| Andreas Brandstädt, Van Bang Le (eds.).;

246 30 a| WG 2001;

260 a| Berlin :b| Springer,c| 2001.;

300 a| x, 327 pages :b| illustrations ;c| 24 cm.;

336 a| textb| txt2| rdacontent;

337 a| unmediatedb| n2| rdamedia;

338 a| volumeb| nc2| rdacarrier;

490 1 a| Lecture notes in computer science,x| 0302-9743 ;v| 2204;

504 a| Includes bibliographical references and author index.;

530 a| Also available via the World Wide Web.;

650 0 a| Computer sciencev| Congresses.=| ^A243325;

650 0 a| Graph theoryv| Congresses.=| ^A25972;

650 0 a| Graph theoryx| Data processingv| Congresses.=| ^A157422;

650 0 a| Graph theory.=| ^A31040;

650 2 a| Algorithms.0| (DNLM)D000465=| ^A923138;

650 2 a| Electronic Data Processing.0| (DNLM)D001330=| ^A917838;

650 7 a| algorithms.2| aat0| (CStmoGRI)aat300065585;

650 7 a| Computer science.2| fast0| (OCoLC)fst00872451;

650 7 a| Graph theory.2| fast0| (OCoLC)fst00946584;

650 7 a| Graph theoryx| Data processing.2| fast0| (OCoLC)fst00946587;

650 7 a| Graphentheorie.2| gnd0| (DE-588)4113782-6;

650 7 a| Kongress.2| gnd0| (DE-588)4130470-6;

650 7 a| Theoretische Informatik.2| gnd0| (DE-588)4196735-5;

650 17 a| Fundamentele informatica.2| gtt;

650 17 a| Grafentheorie.2| gtt;

650 7 a| Computer algorithmsv| Congresses.2| nli;

650 7 a| Graph theoryx| Data processingv| Congresses.2| nli;

650 7 a| Graphes, Théorie desx| Congrès.2| ram;

650 7 a| Grafteorix| Databehandlingv| Kongresser.2| tekord;

653 1 a| Internet resource.;

655 4 a| Kongressz| Boltenhageny| 2001.;

655 7 a| Conference papers and proceedings.2| fast0| (OCoLC)fst01423772;

655 7 a| Boltenhagen (2001)2| swd;

700 1 a| Brandstädt, Andreas.=| ^A514510;

700 1 a| Le, Van Bang.=| ^A514511;

776 0 w| (OCoLC)787475848;

830 0 a| Lecture notes in computer science ;v| 2204.=| ^A466336;

856 41 3| SpringerLinku| https://doi.org/10.1007/3-540-45477-2;

856 41 3| Table of contentsu| http://swbplus.bsz-bw.de/bsz094987734inh.htm;

856 41 u| http://link.springer-ny.com/link/service/series/0558/tocs/t2204.htmz| Restricted to Springer LINK subscribers;

856 41 u| http://link.springer.com/10.1007/3-540-45477-2z| eBook available for UOIT via SpringerLink. Click link to access;

856 41 u| http://www.springerlink.com/link.asp?id=nke837ac5nkh3qkhz| Access restricted to Rutgers University faculty, staff, and studentsz| Electronic version;

856 4 3| Coveru| http://swbplus.bsz-bw.de/bsz094987734cov.htm;

856 4 3| Kapitel 1u| http://swbplus.bsz-bw.de/bsz094987734kap.htm;

856 4 x| LNCSu| http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2204z| Connect to Internet resource;

938 a| Ingram Library Servicesb| INGRn| in502319117;

938 a| Baker & Taylorb| BKTYc| 69.95d| 69.95i| 3540427074n| 0003859917s| active;

938 a| Brodartb| BRODn| 58384014c| $56.00;

938 a| Otto Harrassowitzb| HARRn| har015031967;

938 a| YBP Library Servicesb| YANKn| 1833274;

994 a| C0b| ERE;

596 a| 1;

998 a| 871637;

999 a| QA75.5 .I58 2001w| LCc| 1i| 30372011610497d| 2/7/2013f| 2/7/2013g| 1l| JGESm| JOYNERp| $53.20r| Ys| Yt| JGESBKu| 4/5/2002x| BOOKz| JSTACKSo| .STAFF. 0;

Graph-theoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 : proceedings / Andreas Brandstädt, Van Bang Le (eds.).

Author/creator	International Workshop WG
Other author	Brandstädt, Andreas.
Other author	Le, Van Bang.
Format	Book
Publication Info	Berlin : Springer, 2001.
Description	x, 327 pages : illustrations ; 24 cm.
Supplemental Content	SpringerLink
Supplemental Content	Table of contents
Supplemental Content	Restricted to Springer LINK subscribers
Supplemental Content	eBook available for UOIT via SpringerLink. Click link to access
Supplemental Content	Access restricted to Rutgers University faculty, staff, and students Electronic version
Supplemental Content	Cover
Supplemental Content	Kapitel 1
Supplemental Content	Connect to Internet resource
Subjects	Computer science--Congresses. Graph theory--Congresses. Graph theory--Data processing. --Congresses. Graph theory. Algorithms. Electronic Data Processing.

Portion of title	WG 2001
Series	Lecture notes in computer science, 0302-9743 ; 2204 Lecture notes in computer science ; 2204. ^A466336
Bibliography note	Includes bibliographical references and author index.
Other forms	Also available via the World Wide Web.
Genre/form	Kongress Boltenhagen 2001.
Genre/form	Conference papers and proceedings.
Genre/form	Boltenhagen (2001)
LCCN	2001055114
ISBN	3540427074 (pbk.)
ISBN	9783540427070 (pbk.)
Standard identifier#	9783540427070

Availability

Library	Location	Call Number	Status	Item Actions
Joyner	General Stacks	QA75.5 .I58 2001	✔ Available	Place Hold

Graph-theoretic concepts in computer science : 27th international workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001 : proceedings / Andreas Brandstädt, Van Bang Le (eds.).

Click here for more information about this title

Availability