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

Full description

Saved in:
Bibliographic Details
Main Authors: Tamassia, Roberto, Tollis, Ioannis G
Format: eBook
Language:English
Published: World Scientific Publishing Co. Pte. Ltd 2002
WORLD SCIENTIFIC
World Scientific Publishing
Subjects:
Algorithms
Computer Science
Electrical & Electronic Engineering (Circuits & Systems, Communications, Control, Computer Engineering)
Formal Specification (Software Engineering, Mathematical Logic)
Graph algorithms
Graphic methods
Theoretical Computer Science
Networks
Information Visualization
Graph Drawing
Experimental Studies
Telecommunication Networks
Graph Theory
Data Structures
Algorithm Engineering
Graphs
Graph Algorithms
Scheduling
Analysis of Algorithms
ISBN:9810249268, 9789810249267
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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/.
AbstractList 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/.
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/.Contents:Volume 1:2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms (M Jünger & P Mutzel)Optimal Algorithms to Embed Trees in a Point Set (P Bose et al.)Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring (M M Halldórsson & H C Lau)Volume 2:Algorithms for Cluster Busting in Anchored Graph Drawing (K A Lyons et al.)A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs (L Bai et al.)A Visibility Representation for Graphs in Three Dimensions (P Bose et al.)Scheduled Hot-Potato Routing (J Naor et al.)Treewidth and Minimum Fill-in on d-trapezoid Graphs (H L Bodlaender et al.)Memory Paging for Connectivity and Path Problems in Graphs (E Feuerstein & A Marchetti-Spaccamela)New Lower Bounds for Orthogonal Drawings (T C Biedl)Rectangle-visibility Layouts of Unions and Products of Trees (A M Dean & J P Hutchinson)Volume 3:Edge-Coloring and f-Coloring for Various Classes of Graphs (X Zhou & T Nishizeki)Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs (T Calamoneri et al.)Subgraph Isomorphism in Planar Graphs and Related Problems (D Eppstein)Guest Editors' Introduction (G Di Battista & P Mutzel)Drawing Clustered Graphs on an Orthogonal Grid (P Eades et al.)A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs (M S Rahman et al.)Bounds for Orthogonal 3-D Graph Drawing (T Biedl et al.)Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions (A Papakostas & I G Tollis)Readership: Researchers and professionals in theoretical computer science, computer engineering and combinatorics & graph theory.
Author Tamassia, Roberto
Tollis, Ioannis G
Author_xml – sequence: 1
  fullname: Tamassia, Roberto
– sequence: 2
  fullname: Tollis, Ioannis G
BookMark eNpFkFtLwzAUgCMq6C7_oeCLPkxzay6PWnQOBgqKPoa0Sde4rClNdfjvzazgeTkc-M7tm4CTNrQWgBmC1whRfEMlEUdgIgWiVAjOyPFvATGVmIkzMI_xA6ZALIeCnoOLZa-7JtN-E3o3NLuY6dZkuuu8q_TgQhuz1Qyc1tpHO__LU_D2cP9aPC7WT8tVcbte6DyXMF9gg1nJqlJwI2qIWVVbUeuaMVRCZKwhHFVICmvSZoYs1Ok8K63RpWWMCE2m4GocrOPW7mMT_BDVl7dlCNuoJBfpE8x5ahP_7D703sTK2XZwtavUCCOoDj7UwUdiL0fWbbrP0rvYuHajut7tdP-t3l-ei7ukhHICyQ8ymF6x
ContentType eBook
DBID WMAQA
DEWEY 511.5
DOI 10.1142/4938
DatabaseName World Scientific
DatabaseTitleList

DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISBN 9814488763
9789812777638
9789814488761
9812777636
Editor Tamassia, Roberto
Tollis, Ioannis G
Editor_xml – sequence: 1
  givenname: Roberto
  surname: Tamassia
  fullname: Tamassia, Roberto
  organization: Brown University
– sequence: 2
  givenname: Ioannis G
  surname: Tollis
  fullname: Tollis, Ioannis G
  organization: The University of Texas at Dallas
ExternalDocumentID 9789812777638
10.1142/4938
WSPCB0004730
GroupedDBID -VQ
-VX
089
20A
38.
9WS
A4I
A4J
AABBV
AATMT
ABARN
ABCYV
ABIAV
ABMRC
ABQPQ
ACLGV
ACZWY
ADVEM
AERYV
AFOJC
AHWGJ
AIXPE
AJFER
AKHYG
ALMA_UNASSIGNED_HOLDINGS
ALUEM
AMYDA
AZZ
BBABE
CZZ
DUGUG
EBSCA
ECOWB
GEOUK
HF4
IWG
J-X
JJU
MYL
PD6
PQQKQ
PVBBV
WMAQA
XI1
ID FETCH-LOGICAL-a55905-2d26b6cb87d8f026cfe8faf661b01ded371c198ed08461e0a763e9edabe6638a3
ISBN 9810249268
9789810249267
IngestDate Sun Nov 30 03:40:32 EST 2025
Sat Mar 08 07:58:07 EST 2025
Mon Apr 07 05:00:50 EDT 2025
IsPeerReviewed false
IsScholarly false
Keywords Networks
Information Visualization
Graph Drawing
Experimental Studies
Telecommunication Networks
Graph Theory
Data Structures
Algorithm Engineering
Graphs
Graph Algorithms
Scheduling
Analysis of Algorithms
LCCallNum QA166.245
LCCallNum_Ident QA166.245
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-a55905-2d26b6cb87d8f026cfe8faf661b01ded371c198ed08461e0a763e9edabe6638a3
PageCount 439
ParticipantIDs worldscientific_books_10_1142_4938
askewsholts_vlebooks_9789812777638
igpublishing_primary_WSPCB0004730
ProviderPackageCode J-X
PublicationCentury 2000
PublicationDate 2002.
20020300
2002-03-11
PublicationDateYYYYMMDD 2002-01-01
2002-03-01
2002-03-11
PublicationDate_xml – year: 2002
  text: 2002.
PublicationDecade 2000
PublicationYear 2002
Publisher World Scientific Publishing Co. Pte. Ltd
WORLD SCIENTIFIC
World Scientific Publishing
Publisher_xml – name: World Scientific Publishing Co. Pte. Ltd
– name: WORLD SCIENTIFIC
– name: World Scientific Publishing
SSID ssj0000165084
Score 1.8886223
Snippet 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,...
SourceID askewsholts
worldscientific
igpublishing
SourceType Aggregation Database
Publisher
SubjectTerms Algorithms
Computer Science
Electrical & Electronic Engineering (Circuits & Systems, Communications, Control, Computer Engineering)
Formal Specification (Software Engineering, Mathematical Logic)
Graph algorithms
Graphic methods
Theoretical Computer Science
SubjectTermsDisplay Computer Science
Graph algorithms
Theoretical Computer Science
TableOfContents Graph algorithms and applications I -- Contents -- Volume 1:1-3 (1997) -- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms -- Optimal Algorithms to Embed Trees in a Point Set -- Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction Max Cut and Coloring -- Volume 2:1-8 (1998) -- Algorithms for Cluster Busting in Anchored Graph Drawing -- A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs -- A Visibility Representation for Graphs in Three Dimensions -- Scheduled Hot-Potato Routing -- Treewidth and Minimum Fill-in on d-trapezoid Graphs -- Memory Paging for Connectivity and Path Problems in Graphs -- New Lower Bounds For Orthogonal Drawings -- Rectangle-visibility Layouts of Unions and Products of Trees -- Volume 3:1-3 (1999) -- Edge-Coloring and f-Coloring for Various Classes of Graphs -- Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs -- Subgraph Isomorphism in Planar Graphs and Related Problems -- Volume 3:4 (1999) -- New Trends in Graph Drawing Special Issue on Selected Papers from the 1997 Symposium on Graph Drawing -- Drawing Clustered Graphs on an Orthogonal Grid -- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs -- Bounds for Orthogonal 3-D Graph Drawing -- Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions.
Title Graph algorithms and applications I
URI http://portal.igpublish.com/iglibrary/search/WSPCB0004730.html
https://www.worldscientific.com/doi/10.1142/4938
https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9789812777638&uid=none
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwEB7xUtVFAgpFvBVobygQZ5PYOcKKl3gt6rZwi-zYoRVLsiIL4uczjkPWXfXQHnqJEh8m8XzReGY8_gbgqwhxVSBEul7AAzcQaegKRiI3bVOWBSFpM1l1LbmgV1fs7i7u1iQIZdVOgOY5e32NB_8VahxDsPXR2X-AuxGKA3iPoOMVYcfrmEfcPNb0_Zp7epf37wsM-H8-GvJle4N6lCHt8Ud0mk2drKmtLkbp5n7dIv2s0P2Myrr71ntmwB_LDJhqnMpEVGVHdmKrU-ztdodqz6odMhFlzIghEaR_tq-B5msNYsPIMkZffXlwc_D7cLVO3n7rdg6174jGZBImaYSGaPrk6Pr7eZMM02eqPGZ4Gq1PwCi6eWAfYLb-gn39_ha0ePmACwEuEsNSE83eD5r5tWCuIpwtm8lbTkNvAaaVPknyCSZUvgjz7_0znNqcLkLrsuHMLZfgS4WfM8LPQfwcGz_n7DP8OD7qdU7duoWFyzFU80LXl34kolQwKlmG8W6aKZbxDL0i4RGpZJuSlMRMSZx-RJTH0d6rWEkuFPqCjLeXYSovcrUCji-EjELJqUpp4CkeR1SKWEvOUEGKr8KOpZHkpV9tt5eJUalPKYpmq7BtKyoZGE6TxAYJBY1pLzGSzCF2P9H6X_sLQevwcfRfbsDU8OlZbcJM-jL8VT5t1T_BG25ER8g
linkProvider ProQuest Ebooks
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Graph+algorithms+and+applications+I&rft.au=Tamassia%2C+Roberto&rft.au=Tollis%2C+Ioannis+G&rft.date=2002-01-01&rft.pub=World+Scientific+Publishing+Co.+Pte.+Ltd&rft.isbn=9789810249267&rft_id=info:doi/10.1142%2F4938&rft.externalDBID=WMAQA&rft.externalDocID=WSPCB0004730
thumbnail_m http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97898127%2F9789812777638.jpg
thumbnail_s http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fportal.igpublish.com%2Figlibrary%2Famazonbuffer%2FWSPCB0004730_null_0_320.png
http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fwww.worldscientific.com%2Faction%2FshowCoverImage%3Fdoi%3D10.1142%2F4938