בחרו את שפת העמוד:
שפה נוכחית
Graph algorithms and applications I
להגדלת הטקסט להקטנת הטקסט- ספר
-
שמירהשמורנשמר בהצלחההפריט קיים באזור האישישגיאההכנסו לחשבון כדי לשמור
This book contains volumes 1-3 of the <i>Journal of Graph Algorithms and Applications</i> <i>(JGAA)</i>. Topics of interest include design and analysis of graph algorithms, experiences with graph algorithms, and applications of graph algorithms. <i>JGAA</i> is supported by distinguished advisory and editorial boards, has high scientific standards, and takes advantage of current electronic document technology. The electronic version of <i>JGAA</i> is available on the Web at http://www.cs.brown.edu/publications/jgaa/. <br><i>Contents:</i><ul><li><i><i>Volume 1:</i></i><ul><li>2-Layer Straightli
| כותר |
Graph algorithms and applications I / editors, Roberto Tamassia, Ioannis G. Tollis. |
|---|---|
| כותרים נוספים |
Graph algorithms and applications one Graph algorithms and applications 1 |
| מהדורה |
1st ed. |
| מוציא לאור |
River Edge, N.J. : World Scientific |
| שנה |
c2002 |
| הערות |
Issues for 2006- cataloged as a serial in LC. "Contains volumes 1-3 of the Journal of graph algorithms and applications (JGAA)"--Pref. Includes bibliographical references. English |
| הערת תוכן ותקציר |
Contents Volume 1:1-3 (1997) 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms 1 Introduction 2 Branch and Cut for One Sided Crossing Minimization 3 One Sided Crossing Minimization 4 Two Sided Crossing Minimization 5 Conclusions References Optimal Algorithms to Embed Trees in a Point Set 2 Hull Trees 3 Embedding a Rooted Tree with the Root on the Convex Hull 4 Embedding a Rooted Tree 5 Finding Degree-constrained Embeddings 6 Lower Bounds References Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction Max Cut and Coloring 1 Introduction 2 Preliminaries 3 Simple Local Search 4 Modified Local Search 5 Applications to Induced Subgraph Problems and Graph Coloring Volume 2:1-8 (1998) Algorithms for Cluster Busting in Anchored Graph Drawing 2 Related Work 3 Measuring Similarity and Distribution 4 The Layout Algorithms 5 Results 6 Conclusions and Future Work A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs 1 Introduction 3 Broadcasting Algorithm 4 Conclusion References A Visibility Representation for Graphs in Three Dimensions 2 An Upper Bound 3 A Lower Bound 4 Additional Results |
| היקף החומר |
1 online resource (439 p.) |
| שפה |
אנגלית |
| מספר מערכת |
997010715278505171 |
תצוגת MARC
תגיות
יודעים עוד על הפריט? זיהיתם טעות?
