Cargando…
Graph algorithms and applications I /
This book contains volumes 1-3 of the Journal of Graph Algorithms and Applications (JGAA). Topics of interest include design and analysis of graph algorithms, experiences with graph algorithms, and applications of graph algorithms. JGAA is supported by distinguished advisory and editorial boards, ha...
| Clasificación: | Libro Electrónico |
|---|---|
| Otros Autores: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
River Edge, N.J. :
World Scientific,
©2002.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | EBSCO_ocn261433458 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 081010s2002 njua ob 000 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d YDXCP |d OCLCQ |d UBY |d IDEBK |d E7B |d CEF |d OCLCQ |d OCLCF |d OCLCQ |d NLGGC |d OCLCQ |d AZK |d LOA |d JBG |d AGLDB |d COCUF |d MOR |d PIFAG |d OCLCQ |d U3W |d STF |d WRM |d VTS |d NRAMU |d INT |d VT2 |d OCLCQ |d WYU |d OCLCQ |d AU@ |d M8D |d UKAHL |d OCLCQ |d K6U |d UKCRE |d OCLCO |d OCLCQ |d OCL |d OCLCQ |d OCLCO | ||
| 019 | |a 505142856 |a 646768648 |a 764500949 |a 961537285 |a 962678717 |a 968284054 |a 988437740 |a 992030928 |a 1037700720 |a 1038592428 |a 1045512981 |a 1055356247 |a 1064888440 |a 1081256911 |a 1153497311 |a 1228540242 | ||
| 020 | |a 9789812777638 |q (electronic bk.) | ||
| 020 | |a 9812777636 |q (electronic bk.) | ||
| 020 | |a 9789810249267 | ||
| 020 | |a 9810249268 | ||
| 020 | |z 9810249268 | ||
| 029 | 1 | |a AU@ |b 000049163168 | |
| 029 | 1 | |a AU@ |b 000051368151 | |
| 029 | 1 | |a DEBBG |b BV043122513 | |
| 029 | 1 | |a DEBSZ |b 422098620 | |
| 029 | 1 | |a GBVCP |b 802688381 | |
| 029 | 1 | |a NZ1 |b 13858094 | |
| 035 | |a (OCoLC)261433458 |z (OCoLC)505142856 |z (OCoLC)646768648 |z (OCoLC)764500949 |z (OCoLC)961537285 |z (OCoLC)962678717 |z (OCoLC)968284054 |z (OCoLC)988437740 |z (OCoLC)992030928 |z (OCoLC)1037700720 |z (OCoLC)1038592428 |z (OCoLC)1045512981 |z (OCoLC)1055356247 |z (OCoLC)1064888440 |z (OCoLC)1081256911 |z (OCoLC)1153497311 |z (OCoLC)1228540242 | ||
| 050 | 4 | |a QA166.245 |b .G73 2002eb | |
| 072 | 7 | |a MAT |x 013000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511/.5 |2 22 |
| 049 | |a UAMI | ||
| 245 | 0 | 0 | |a Graph algorithms and applications I / |c editors, Roberto Tamassia, Ioannis G. Tollis. |
| 246 | 3 | |a Graph algorithms and applications one | |
| 246 | 3 | |a Graph algorithms and applications 1 | |
| 260 | |a River Edge, N.J. : |b World Scientific, |c ©2002. | ||
| 300 | |a 1 online resource (x, 427 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 | ||
| 500 | |a "Contains volumes 1-3 of the Journal of graph algorithms and applications (JGAA)"--Preface | ||
| 504 | |a Includes bibliographical references. | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a V. 1:1-3 (1997). 2-Layer straightline crossing minimization: performance of exact and heuristic algorithms / M. Jünger and P. Mutzel. Communicated by P. Eades -- Optimal algorithms to embed trees in a point set / P. Bose, M. McAllister and J. Snoeyink. Communicated by P. Eades -- Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring / M.M. Halldórsson and H.C. Lau. Communicated by M. Fürer -- v. 2:1-8 (1998). Algorithms for cluster busting in anchored graph drawing / K.A. Lyons, H. Meijer and D. Rappaport. Communicated by G. Di Battista -- A broadcasting algorithm with time and message optimum on arrangement graphs / L. Bai [and others]. Communicated by A. Itai -- A visibility representation for graphs in three dimensions / P. Bose [and others]. Communicated by M.T. Goodrich -- Scheduled hot-potato routing / J. Naor, A. Orda and R. Rom. Communicated by S. Khuller -- Treewidth and minimum fill-in on d-trapezoid graphs / H.L. Bodlaender [and others]. Communicated by S. Khuller -- Memory paging for connectivity and path problems in graphs / E. Feuerstein and A. Marchetti-Spaccamela. Communicated by R. Tamassia -- New lower bounds for orthogonal drawings / T.C. Biedl. Communicated by D. Wagner -- Rectangle-visibility layouts of unions and products of trees / A.M. Dean and J.P. Hutchinson. Communicated by J.S.B. Mitchell -- v. 3:1-3 (1999). Edge-coloring and [symbol]-coloring for various classes of graphs / X. Zhou and T. Nishizeki. Communicated by M. Kaufmann -- Experimental comparison of graph drawing algorithms for cubic graphs / T. Calamoneri, S. Jannelli and R. Petreschi. Communicated by R. Tamassia -- Subgraph isomorphism in planar graphs and related problems / D. Eppstein. Communicated by R. Tamassia -- v. 3:4 (1999). Special issue on selected papers from the 1997 symposium on graph drawing / guest editors: G. Di Battista and P. Mutzel. Guest editors' introduction / G. Di Battista and P. Mutzel. Communicated by R. Tamassia and I.G. Tollis -- Drawing clustered graphs on an orthogonal Grid / P. Eades, Q. Feng and H. Nagamochi. Communicated by G. Di Battista and P. Mutzel -- A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs / M.S. Rahman, S. Nakano and T. Nishizeki. Communicated by G. Di Battista and P. Mutzel -- Bounds for orthogonal 3-D graph drawing / T. Biedl [and others]. Communicated by G. Di Battista and P. Mutzel -- Algorithms for incremental orthogonal graph drawing in three dimensions / A. Papakostas and I.G. Tollis. Communicated by G. Di Battista and P. Mutzel. | |
| 520 | |a This book contains volumes 1-3 of the Journal of Graph Algorithms and Applications (JGAA). Topics of interest include design and analysis of graph algorithms, experiences with graph algorithms, and applications of graph algorithms. JGAA is supported by distinguished advisory and editorial boards, has high scientific standards, and takes advantage of current electronic document technology. The electronic version of JGAA is available on the Web at http://www.cs.brown.edu/publications/jgaa. | ||
| 590 | |a eBooks on EBSCOhost |b EBSCO eBook Subscription Academic Collection - Worldwide | ||
| 650 | 0 | |a Graph algorithms. | |
| 650 | 0 | |a Graph theory. | |
| 650 | 2 | |a Algorithms | |
| 650 | 6 | |a Théorie des graphes. | |
| 650 | 6 | |a Algorithmes. | |
| 650 | 6 | |a Algorithmes de graphes. | |
| 650 | 7 | |a algorithms. |2 aat | |
| 650 | 7 | |a MATHEMATICS |x Graphic Methods. |2 bisacsh | |
| 650 | 7 | |a Graph theory |2 fast | |
| 650 | 7 | |a Graph algorithms |2 fast | |
| 700 | 1 | |a Tamassia, Roberto, |d 1960- | |
| 700 | 1 | |a Tollis, Ioannis G., |d 1958- | |
| 730 | 0 | 2 | |a Journal of graph algorithms and applications. |
| 776 | 0 | 8 | |i Print version: |t Graph algorithms and applications I. |d River Edge, N.J. : World Scientific, ©2002 |z 9810249268 |z 9789810249267 |w (DLC) 2002514171 |w (OCoLC)50552775 |
| 856 | 4 | 0 | |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235740 |z Texto completo |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH24684745 | ||
| 938 | |a ebrary |b EBRY |n ebr10255727 | ||
| 938 | |a EBSCOhost |b EBSC |n 235740 | ||
| 938 | |a YBP Library Services |b YANK |n 2889248 | ||
| 994 | |a 92 |b IZTAP | ||