|
|
|
|
LEADER |
00000cam a2200000Ma 4500 |
001 |
EBOOKCENTRAL_ocn774694144 |
003 |
OCoLC |
005 |
20240329122006.0 |
006 |
m o d |
007 |
cr c||---||||| |
008 |
890202s1989 riua ob 100 0 eng d |
010 |
|
|
|a 89000216
|
040 |
|
|
|a COO
|b eng
|e pn
|c COO
|d OTZ
|d OCLCF
|d OCLCO
|d UIU
|d E7B
|d YDXCP
|d OCL
|d OCLCO
|d OCLCQ
|d OCLCO
|d EBLCP
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCA
|d OCLCQ
|d YOU
|d OCLCQ
|d LIP
|d OCLCQ
|d LEAUB
|d VT2
|d K6U
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
019 |
|
|
|a 882236948
|a 922980243
|a 1077901494
|a 1086508586
|a 1120900356
|a 1241791793
|a 1262690058
|
020 |
|
|
|a 9780821876770
|q (online)
|
020 |
|
|
|a 0821876775
|q (online)
|
020 |
|
|
|a 9780821854228
|q (google)
|
020 |
|
|
|a 0821854224
|q (google)
|
020 |
|
|
|z 0821850954
|q (alk. paper)
|
020 |
|
|
|z 9780821850954
|q (alk. paper)
|
035 |
|
|
|a (OCoLC)774694144
|z (OCoLC)882236948
|z (OCoLC)922980243
|z (OCoLC)1077901494
|z (OCoLC)1086508586
|z (OCoLC)1120900356
|z (OCoLC)1241791793
|z (OCoLC)1262690058
|
050 |
|
4 |
|a QA166
|b .A47 1987
|
082 |
0 |
4 |
|a 511/.5
|2 19
|
049 |
|
|
|a UAMI
|
111 |
2 |
|
|a AMS-IMS-SIAM Joint Summer Research Conference in the Mathematical Sciences on Graphs and Algorithms
|d (1987 :
|c University of Colorado)
|
245 |
1 |
0 |
|a Graphs and algorithms :
|b proceedings of the AMS-IMS-SIAM joint summer research conference held June 28-July 4, 1987 with support from the National Science Foundation /
|c R. Bruce Richter, editor.
|
260 |
|
|
|a Providence, R.I. :
|b American Mathematical Society,
|c ©1989.
|
300 |
|
|
|a 1 online resource (xv, 197 pages) :
|b illustrations
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|a Contemporary mathematics,
|x 0271-4132 ;
|v v. 89
|
500 |
|
|
|a "The AMS-IMS-SIAM Joint Summer Research Conference in the Mathematical Sciences on Graphs and Algorithms was held at the University of Colorado, Boulder, Colorado"--Title page verso.
|
504 |
|
|
|a Includes bibliographical references.
|
505 |
0 |
0 |
|t The Robertson-Seymour theorems: a survey of applications /
|r Michael R. Fellows --
|u http://www.ams.org/conm/089/
|u http://dx.doi.org/10.1090/conm/089/1006472
|t On genus-reducing and planarizing algorithms for embedded graphs /
|r Joan P. Hutchinson --
|u http://www.ams.org/conm/089/
|u http://dx.doi.org/10.1090/conm/089/1006473
|t Interval hypergraphs /
|r Arnold L. Rosenberg --
|u http://www.ams.org/conm/089/
|u http://dx.doi.org/10.1090/conm/089/1006474
|t Competitive algorithms for on-line problems /
|r Mark S. Manasse, Lyle A. McGeoch and Daniel D. Sleator --
|u http://www.ams.org/conm/089/
|u http://dx.doi.org/10.1090/conm/089/1006475
|t On recognizability of planar graphs /
|r Larry I. Basenspiler --
|u http://www.ams.org/conm/089/
|u http://dx.doi.org/10.1090/conm/089/1006476
|t Combinatorial computation of moduli dimension of Nielsen classes of covers /
|r Mike Fried --
|u http://www.ams.org/conm/089/
|u http://dx.doi.org/10.1090/conm/089/1006477
|t Labeled trees and the algebra of differential operators /
|r Robert Grossman and Richard G. Larson --
|u http://www.ams.org/conm/089/
|u http://dx.doi.org/10.1090/conm/089/1006478
|t Computing edge-toughness and fractional arboricity /
|r Arthur M. Hobbs --
|u http://www.ams.org/conm/089/
|u http://dx.doi.org/10.1090/conm/089/1006479
|t Directed Graphs and the Compaction of IC Designs /
|r Bradley W. Jackson --
|u http://www.ams.org/conm/089/
|u http://dx.doi.org/10.1090/conm/089/09
|t Parallelism, preprocessing, and reachability /
|r Philip N. Klein --
|u http://www.ams.org/conm/089/
|u http://dx.doi.org/10.1090/conm/089/1006481
|t A summary of results on pair-connected reliability /
|r Peter J. Slater --
|u http://www.ams.org/conm/089/
|u http://dx.doi.org/10.1090/conm/089/1006482
|t On minimum cuts of cycles and maximum disjoint cycles /
|r Jayme L. Szwarcfiter --
|u http://www.ams.org/conm/089/
|u http://dx.doi.org/10.1090/conm/089/1006483
|t Graphs and finitely presented groups /
|r Andrew Vince --
|u http://www.ams.org/conm/089/
|u http://dx.doi.org/10.1090/conm/089/1006484
|t Problem Corner
|u http://www.ams.org/conm/089/
|u http://dx.doi.org/10.1090/conm/089/13
|
546 |
|
|
|a English.
|
590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
650 |
|
0 |
|a Graph theory
|v Congresses.
|
650 |
|
0 |
|a Computer algorithms
|v Congresses.
|
650 |
|
6 |
|a Algorithmes
|v Congrès.
|
650 |
|
7 |
|a Computer algorithms
|2 fast
|
650 |
|
7 |
|a Graph theory
|2 fast
|
655 |
|
7 |
|a Conference papers and proceedings
|2 fast
|
700 |
1 |
|
|a Richter, R. Bruce.
|
710 |
2 |
|
|a American Mathematical Society.
|
710 |
2 |
|
|a Institute of Mathematical Statistics.
|
710 |
2 |
|
|a Society for Industrial and Applied Mathematics.
|
758 |
|
|
|i has work:
|a Graphs and algorithms (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCXGXV3CM33kQrvQr8RFmbb
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
776 |
0 |
8 |
|i Print version:
|a Richter, R. Bruce.
|t Graphs and Algorithms.
|d Providence : American Mathematical Society, ©1989
|z 9780821850954
|
830 |
|
0 |
|a Contemporary mathematics (American Mathematical Society) ;
|v v. 89.
|
856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=3112849
|z Texto completo
|
938 |
|
|
|a ProQuest Ebook Central
|b EBLB
|n EBL3112849
|
938 |
|
|
|a ebrary
|b EBRY
|n ebr10873012
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 11827043
|
994 |
|
|
|a 92
|b IZTAP
|