Verfügbarkeit: Graph algorithms and applications I /

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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Weitere Verfasser:	Tamassia, Roberto, 1960-, Tollis, Ioannis G., 1958-
Format:	Elektronisch E-Book
Sprache:	English
Veröffentlicht:	River Edge, N.J. : World Scientific, ©2002.
Schlagworte:	Graph algorithms. Graph theory. Algorithms Théorie des graphes. Algorithmes. Algorithmes de graphes. algorithms. MATHEMATICS > Graphic Methods. Graph theory Graph algorithms
Online-Zugang:	Volltext
Zusammenfassung:	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.
Beschreibung:	"Contains volumes 1-3 of the Journal of graph algorithms and applications (JGAA)"--Preface
Beschreibung:	1 online resource (x, 427 pages) : illustrations
Bibliographie:	Includes bibliographical references.
ISBN:	9789812777638 9812777636 9789810249267 9810249268

Internformat

MARC


LEADER	00000cam a2200000 a 4500
001	ZDB-4-EBA-ocn261433458
003	OCoLC
005	20241004212047.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 \|d OCLCL \|d OCLCQ
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
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	7		\|a 511/.5 \|2 22
049			\|a MAIN
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. Halldó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.
650		0	\|a Graph algorithms. \|0 http://id.loc.gov/authorities/subjects/sh2002004605
650		0	\|a Graph theory. \|0 http://id.loc.gov/authorities/subjects/sh85056471
650		2	\|a Algorithms \|0 https://id.nlm.nih.gov/mesh/D000465
650		6	\|a Thé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- \|1 https://id.oclc.org/worldcat/entity/E39PBJhxq7Wb4F3F6694WyBpT3 \|0 http://id.loc.gov/authorities/names/n94122376
700	1		\|a Tollis, Ioannis G., \|d 1958- \|1 https://id.oclc.org/worldcat/entity/E39PCjFmvVyqf97q3hFKvB9crq \|0 http://id.loc.gov/authorities/names/n94122378
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	\|l FWS01 \|p ZDB-4-EBA \|q FWS_PDA_EBA \|u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235740 \|3 Volltext
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 GEBAY
912			\|a ZDB-4-EBA
049			\|a DE-863

Datensatz im Suchindex

DE-BY-FWS_katkey	ZDB-4-EBA-ocn261433458
_version_	1816881678837088256
adam_text
any_adam_object
author2	Tamassia, Roberto, 1960- Tollis, Ioannis G., 1958-
author2_role
author2_variant	r t rt i g t ig igt
author_GND	http://id.loc.gov/authorities/names/n94122376 http://id.loc.gov/authorities/names/n94122378
author_facet	Tamassia, Roberto, 1960- Tollis, Ioannis G., 1958-
author_sort	Tamassia, Roberto, 1960-
building	Verbundindex
bvnumber	localFWS
callnumber-first	Q - Science
callnumber-label	QA166
callnumber-raw	QA166.245 .G73 2002eb
callnumber-search	QA166.245 .G73 2002eb
callnumber-sort	QA 3166.245 G73 42002EB
callnumber-subject	QA - Mathematics
collection	ZDB-4-EBA
contents	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. Halldó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.
ctrlnum	(OCoLC)261433458
dewey-full	511/.5
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	511 - General principles of mathematics
dewey-raw	511/.5
dewey-search	511/.5
dewey-sort	3511 15
dewey-tens	510 - Mathematics
discipline	Mathematik
format	Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06511cam a2200637 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn261433458</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">081010s2002 njua ob 000 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UBY</subfield><subfield code="d">IDEBK</subfield><subfield code="d">E7B</subfield><subfield code="d">CEF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">NLGGC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AZK</subfield><subfield code="d">LOA</subfield><subfield code="d">JBG</subfield><subfield code="d">AGLDB</subfield><subfield code="d">COCUF</subfield><subfield code="d">MOR</subfield><subfield code="d">PIFAG</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">U3W</subfield><subfield code="d">STF</subfield><subfield code="d">WRM</subfield><subfield code="d">VTS</subfield><subfield code="d">NRAMU</subfield><subfield code="d">INT</subfield><subfield code="d">VT2</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">WYU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AU@</subfield><subfield code="d">M8D</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">UKCRE</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">505142856</subfield><subfield code="a">646768648</subfield><subfield code="a">764500949</subfield><subfield code="a">961537285</subfield><subfield code="a">962678717</subfield><subfield code="a">968284054</subfield><subfield code="a">988437740</subfield><subfield code="a">992030928</subfield><subfield code="a">1037700720</subfield><subfield code="a">1038592428</subfield><subfield code="a">1045512981</subfield><subfield code="a">1055356247</subfield><subfield code="a">1064888440</subfield><subfield code="a">1081256911</subfield><subfield code="a">1153497311</subfield><subfield code="a">1228540242</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789812777638</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9812777636</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789810249267</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9810249268</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9810249268</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)261433458</subfield><subfield code="z">(OCoLC)505142856</subfield><subfield code="z">(OCoLC)646768648</subfield><subfield code="z">(OCoLC)764500949</subfield><subfield code="z">(OCoLC)961537285</subfield><subfield code="z">(OCoLC)962678717</subfield><subfield code="z">(OCoLC)968284054</subfield><subfield code="z">(OCoLC)988437740</subfield><subfield code="z">(OCoLC)992030928</subfield><subfield code="z">(OCoLC)1037700720</subfield><subfield code="z">(OCoLC)1038592428</subfield><subfield code="z">(OCoLC)1045512981</subfield><subfield code="z">(OCoLC)1055356247</subfield><subfield code="z">(OCoLC)1064888440</subfield><subfield code="z">(OCoLC)1081256911</subfield><subfield code="z">(OCoLC)1153497311</subfield><subfield code="z">(OCoLC)1228540242</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA166.245</subfield><subfield code="b">.G73 2002eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">013000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Graph algorithms and applications I /</subfield><subfield code="c">editors, Roberto Tamassia, Ioannis G. Tollis.</subfield></datafield><datafield tag="246" ind1="3" ind2=" "><subfield code="a">Graph algorithms and applications one</subfield></datafield><datafield tag="246" ind1="3" ind2=" "><subfield code="a">Graph algorithms and applications 1</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">River Edge, N.J. :</subfield><subfield code="b">World Scientific,</subfield><subfield code="c">©2002.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (x, 427 pages) :</subfield><subfield code="b">illustrations</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">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">"Contains volumes 1-3 of the Journal of graph algorithms and applications (JGAA)"--Preface</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="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. Halldó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.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Graph algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh2002004605</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Graph theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85056471</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Algorithms</subfield><subfield code="0">https://id.nlm.nih.gov/mesh/D000465</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des graphes.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes de graphes.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithms.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Graphic Methods.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graph theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graph algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tamassia, Roberto,</subfield><subfield code="d">1960-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJhxq7Wb4F3F6694WyBpT3</subfield><subfield code="0">http://id.loc.gov/authorities/names/n94122376</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tollis, Ioannis G.,</subfield><subfield code="d">1958-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjFmvVyqf97q3hFKvB9crq</subfield><subfield code="0">http://id.loc.gov/authorities/names/n94122378</subfield></datafield><datafield tag="730" ind1="0" ind2="2"><subfield code="a">Journal of graph algorithms and applications.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="t">Graph algorithms and applications I.</subfield><subfield code="d">River Edge, N.J. : World Scientific, ©2002</subfield><subfield code="z">9810249268</subfield><subfield code="z">9789810249267</subfield><subfield code="w">(DLC) 2002514171</subfield><subfield code="w">(OCoLC)50552775</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235740</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH24684745</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10255727</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">235740</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2889248</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection>
id	ZDB-4-EBA-ocn261433458
illustrated	Illustrated
indexdate	2024-11-27T13:16:32Z
institution	BVB
isbn	9789812777638 9812777636 9789810249267 9810249268
language	English
oclc_num	261433458
open_access_boolean
owner	MAIN DE-863 DE-BY-FWS
owner_facet	MAIN DE-863 DE-BY-FWS
physical	1 online resource (x, 427 pages) : illustrations
psigel	ZDB-4-EBA
publishDate	2002
publishDateSearch	2002
publishDateSort	2002
publisher	World Scientific,
record_format	marc
spelling	Graph algorithms and applications I / editors, Roberto Tamassia, Ioannis G. Tollis. Graph algorithms and applications one Graph algorithms and applications 1 River Edge, N.J. : World Scientific, ©2002. 1 online resource (x, 427 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier "Contains volumes 1-3 of the Journal of graph algorithms and applications (JGAA)"--Preface Includes bibliographical references. Print version record. 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. Halldó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. 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. Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Algorithms https://id.nlm.nih.gov/mesh/D000465 Théorie des graphes. Algorithmes. Algorithmes de graphes. algorithms. aat MATHEMATICS Graphic Methods. bisacsh Graph theory fast Graph algorithms fast Tamassia, Roberto, 1960- https://id.oclc.org/worldcat/entity/E39PBJhxq7Wb4F3F6694WyBpT3 http://id.loc.gov/authorities/names/n94122376 Tollis, Ioannis G., 1958- https://id.oclc.org/worldcat/entity/E39PCjFmvVyqf97q3hFKvB9crq http://id.loc.gov/authorities/names/n94122378 Journal of graph algorithms and applications. Print version: Graph algorithms and applications I. River Edge, N.J. : World Scientific, ©2002 9810249268 9789810249267 (DLC) 2002514171 (OCoLC)50552775 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235740 Volltext
spellingShingle	Graph algorithms and applications I / 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. Halldó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. Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Algorithms https://id.nlm.nih.gov/mesh/D000465 Théorie des graphes. Algorithmes. Algorithmes de graphes. algorithms. aat MATHEMATICS Graphic Methods. bisacsh Graph theory fast Graph algorithms fast
subject_GND	http://id.loc.gov/authorities/subjects/sh2002004605 http://id.loc.gov/authorities/subjects/sh85056471 https://id.nlm.nih.gov/mesh/D000465
title	Graph algorithms and applications I /
title_alt	Graph algorithms and applications one Graph algorithms and applications 1 Journal of graph algorithms and applications.
title_auth	Graph algorithms and applications I /
title_exact_search	Graph algorithms and applications I /
title_full	Graph algorithms and applications I / editors, Roberto Tamassia, Ioannis G. Tollis.
title_fullStr	Graph algorithms and applications I / editors, Roberto Tamassia, Ioannis G. Tollis.
title_full_unstemmed	Graph algorithms and applications I / editors, Roberto Tamassia, Ioannis G. Tollis.
title_short	Graph algorithms and applications I /
title_sort	graph algorithms and applications i
topic	Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Algorithms https://id.nlm.nih.gov/mesh/D000465 Théorie des graphes. Algorithmes. Algorithmes de graphes. algorithms. aat MATHEMATICS Graphic Methods. bisacsh Graph theory fast Graph algorithms fast
topic_facet	Graph algorithms. Graph theory. Algorithms Théorie des graphes. Algorithmes. Algorithmes de graphes. algorithms. MATHEMATICS Graphic Methods. Graph theory Graph algorithms
url	https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235740
work_keys_str_mv	UT journalofgraphalgorithmsandapplications AT tamassiaroberto graphalgorithmsandapplicationsi AT tollisioannisg graphalgorithmsandapplicationsi AT tamassiaroberto graphalgorithmsandapplicationsone AT tollisioannisg graphalgorithmsandapplicationsone AT tamassiaroberto graphalgorithmsandapplications1 AT tollisioannisg graphalgorithmsandapplications1

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Volltext öffnen

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge