Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Graph algorithms and applications 2 [[electronic resource] /] / Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
| Graph algorithms and applications 2 [[electronic resource] /] / Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, 2004 |
| Descrizione fisica | 1 online resource (534 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
LiottaGiuseppe
TamassiaRoberto <1960-> TollisIoannis G. <1958-> |
| Soggetto topico |
Graph algorithms
Mathematics |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-93463-1
9786611934637 981-279-474-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Contents ; Volume 4:1 (2000) ; Approximations of Weighted Independent Set and Hereditary Subset Problems ; Volume 4:2 (2000) ; Approximation Algorithms for Some Graph Partitioning Problems ; Volume 4:3 (2000)
Advances in Graph Drawing Special Issue on Selected Papers from the Sixth International Symposium on Graph Drawing GD'98 Guest Editors' Foreword Geometric Thickness of Complete Graphs ; Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms Techniques for the Refinement of Orthogonal Graph Drawings ; A Split & Push Approach to 3D Orthogonal Drawing ; Using Graph Layout to Visualize Train Interconnection Data Navigating Clustered Graphs Using Force-Directed Methods Dynamic WWW Structures in 3D ; Volume 4:4 (2000) ; Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees ; Volume 5:1 (2001) ; Planarizing Graphs - A Survey and Annotated Bibliography ; Volume 5:2 (2001) Fully Dynamic 3-Dimensional Orthogonal Graph Drawing Volume 5:3 (2001) ; 1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved ; Volume 5:4 (2001) ; Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems ; Volume 5:5 (2001) Special Issue on Selected Papers from the 1998 Dagstuhl Seminar on Graph Algorithms and Applications |
| Record Nr. | UNINA-9910454300103321 |
| River Edge, N.J., : World Scientific, 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph algorithms and applications 2 [[electronic resource] /] / Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
| Graph algorithms and applications 2 [[electronic resource] /] / Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, 2004 |
| Descrizione fisica | 1 online resource (534 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
LiottaGiuseppe
TamassiaRoberto <1960-> TollisIoannis G. <1958-> |
| Soggetto topico |
Graph algorithms
Mathematics |
| ISBN |
1-281-93463-1
9786611934637 981-279-474-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Contents ; Volume 4:1 (2000) ; Approximations of Weighted Independent Set and Hereditary Subset Problems ; Volume 4:2 (2000) ; Approximation Algorithms for Some Graph Partitioning Problems ; Volume 4:3 (2000)
Advances in Graph Drawing Special Issue on Selected Papers from the Sixth International Symposium on Graph Drawing GD'98 Guest Editors' Foreword Geometric Thickness of Complete Graphs ; Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms Techniques for the Refinement of Orthogonal Graph Drawings ; A Split & Push Approach to 3D Orthogonal Drawing ; Using Graph Layout to Visualize Train Interconnection Data Navigating Clustered Graphs Using Force-Directed Methods Dynamic WWW Structures in 3D ; Volume 4:4 (2000) ; Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees ; Volume 5:1 (2001) ; Planarizing Graphs - A Survey and Annotated Bibliography ; Volume 5:2 (2001) Fully Dynamic 3-Dimensional Orthogonal Graph Drawing Volume 5:3 (2001) ; 1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved ; Volume 5:4 (2001) ; Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems ; Volume 5:5 (2001) Special Issue on Selected Papers from the 1998 Dagstuhl Seminar on Graph Algorithms and Applications |
| Record Nr. | UNINA-9910782120403321 |
| River Edge, N.J., : World Scientific, 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph algorithms and applications 2 / / Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
| Graph algorithms and applications 2 / / Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, 2004 |
| Descrizione fisica | 1 online resource (534 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
LiottaGiuseppe
TamassiaRoberto <1960-> TollisIoannis G. <1958-> |
| Soggetto topico |
Graph algorithms
Mathematics |
| ISBN |
1-281-93463-1
9786611934637 981-279-474-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Contents ; Volume 4:1 (2000) ; Approximations of Weighted Independent Set and Hereditary Subset Problems ; Volume 4:2 (2000) ; Approximation Algorithms for Some Graph Partitioning Problems ; Volume 4:3 (2000)
Advances in Graph Drawing Special Issue on Selected Papers from the Sixth International Symposium on Graph Drawing GD'98 Guest Editors' Foreword Geometric Thickness of Complete Graphs ; Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms Techniques for the Refinement of Orthogonal Graph Drawings ; A Split & Push Approach to 3D Orthogonal Drawing ; Using Graph Layout to Visualize Train Interconnection Data Navigating Clustered Graphs Using Force-Directed Methods Dynamic WWW Structures in 3D ; Volume 4:4 (2000) ; Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees ; Volume 5:1 (2001) ; Planarizing Graphs - A Survey and Annotated Bibliography ; Volume 5:2 (2001) Fully Dynamic 3-Dimensional Orthogonal Graph Drawing Volume 5:3 (2001) ; 1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved ; Volume 5:4 (2001) ; Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems ; Volume 5:5 (2001) Special Issue on Selected Papers from the 1998 Dagstuhl Seminar on Graph Algorithms and Applications |
| Altri titoli varianti | Graph algorithms and applications two |
| Record Nr. | UNINA-9910824945103321 |
| River Edge, N.J., : World Scientific, 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph algorithms and applications 3 [[electronic resource] /] / editors, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
| Graph algorithms and applications 3 [[electronic resource] /] / editors, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, c2004 |
| Descrizione fisica | 1 online resource (412p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
LiottaGiuseppe, Ph. D.
TamassiaRoberto <1960-> TollisIoannis G. <1958-> |
| Soggetto topico |
Graph algorithms
Graph theory |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-95599-X
9786611955991 981-279-660-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Volume 6:1 (2002). Special issue on graph drawing and representations: selected papers from the 1999 symposium on graph drawing. Guest editors: Hubert de Praysseix and Jan Kratochvil. Guest editors' foreword / Hubert de Fraysseix and Jan Kratochvil. Triangle-free planar graphs and segment intersection graphs / Natalia de Castro ... [et al.]. Communicated by Hubert de Fraysseix and Jan Kratochvil. Planar graphs with topological constraints / Christoph Dornheim. Communicated by Hubert de Fraysseix and Jan Kratochvil. Level planar embedding in linear time / Michael Jünger and Sebastian Leipert. Communicated by Hubert de Fraysseix and Jan Kratochvil. Embedding vertices at points: few bends suffice for planar graphs / Michael Kaufmann and Roland Wiese. Communicated by Hubert de Fraysseix and Jan Kratochvil. Art of graph drawing and art / Jaroslav Nešetřil. Communicated by Hubert de Fraysseix and Jan Kratochvil. Realization of Posets / Patrice Ossona de Mendez. Communicated by Hubert de Fraysseix and Jan Kratochvil -- Volume 6:2 (2002). Traversing directed Eulerian mazes / S. Bhatt ... [et al.]. Communicated by Samir Khuller -- Volume 6:3 (2002). Special issue on selected papers from the 2000 symposium on graph drawing. Guest editors: Michael Kaufmann. Guest editor's foreword / Michael Kaufmann. A fast multi-scale method for drawing large graphs / David Harel and Yehuda Koren. Communicated by Michael Kaufmann. GRIP: graph drawing with intelligent placement / Pawel Gajer and Stephen G. Kobourov. Communicated by Michael Kaufmann. A user study in similarity measures for graph drawing / Stina Bridgeman and Roberto Tamassia. Communicated by Michael Kaufmann. Graph layout aesthetics in UML diagrams: user preferences / Helen C. Purchase, Jo-Anne Allder and David Carrington. Communicated by Michael Kaufmann. Visualization of the high level structure of the internet with Hermes / Andrea Carmignani ... [et al.]. Communicated by Michael Kaufmann. A framework for the static and interactive visualization of statecharts / Rodolfo Castelló, Rym Mili and Ioannis G. Tollis. Communicated by Michael Kaufmann. Graph drawing in motion / Carsten Friedrich and Peter Eades. Communicated by Michael Kaufmann -- Volume 6:4 (2002). A 6-regular Torus graph family with applications to cellular and interconnection networks / Mihaela Iridon and David W. Matula. Communicated by Balaji Raghavachari. |
| Record Nr. | UNINA-9910454091403321 |
| River Edge, N.J., : World Scientific, c2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph algorithms and applications 3 [[electronic resource] /] / editors, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
| Graph algorithms and applications 3 [[electronic resource] /] / editors, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, c2004 |
| Descrizione fisica | 1 online resource (412p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
LiottaGiuseppe, Ph. D.
TamassiaRoberto <1960-> TollisIoannis G. <1958-> |
| Soggetto topico |
Graph algorithms
Graph theory |
| ISBN |
1-281-95599-X
9786611955991 981-279-660-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Volume 6:1 (2002). Special issue on graph drawing and representations: selected papers from the 1999 symposium on graph drawing. Guest editors: Hubert de Praysseix and Jan Kratochvil. Guest editors' foreword / Hubert de Fraysseix and Jan Kratochvil. Triangle-free planar graphs and segment intersection graphs / Natalia de Castro ... [et al.]. Communicated by Hubert de Fraysseix and Jan Kratochvil. Planar graphs with topological constraints / Christoph Dornheim. Communicated by Hubert de Fraysseix and Jan Kratochvil. Level planar embedding in linear time / Michael Jünger and Sebastian Leipert. Communicated by Hubert de Fraysseix and Jan Kratochvil. Embedding vertices at points: few bends suffice for planar graphs / Michael Kaufmann and Roland Wiese. Communicated by Hubert de Fraysseix and Jan Kratochvil. Art of graph drawing and art / Jaroslav Nešetřil. Communicated by Hubert de Fraysseix and Jan Kratochvil. Realization of Posets / Patrice Ossona de Mendez. Communicated by Hubert de Fraysseix and Jan Kratochvil -- Volume 6:2 (2002). Traversing directed Eulerian mazes / S. Bhatt ... [et al.]. Communicated by Samir Khuller -- Volume 6:3 (2002). Special issue on selected papers from the 2000 symposium on graph drawing. Guest editors: Michael Kaufmann. Guest editor's foreword / Michael Kaufmann. A fast multi-scale method for drawing large graphs / David Harel and Yehuda Koren. Communicated by Michael Kaufmann. GRIP: graph drawing with intelligent placement / Pawel Gajer and Stephen G. Kobourov. Communicated by Michael Kaufmann. A user study in similarity measures for graph drawing / Stina Bridgeman and Roberto Tamassia. Communicated by Michael Kaufmann. Graph layout aesthetics in UML diagrams: user preferences / Helen C. Purchase, Jo-Anne Allder and David Carrington. Communicated by Michael Kaufmann. Visualization of the high level structure of the internet with Hermes / Andrea Carmignani ... [et al.]. Communicated by Michael Kaufmann. A framework for the static and interactive visualization of statecharts / Rodolfo Castelló, Rym Mili and Ioannis G. Tollis. Communicated by Michael Kaufmann. Graph drawing in motion / Carsten Friedrich and Peter Eades. Communicated by Michael Kaufmann -- Volume 6:4 (2002). A 6-regular Torus graph family with applications to cellular and interconnection networks / Mihaela Iridon and David W. Matula. Communicated by Balaji Raghavachari. |
| Record Nr. | UNINA-9910782284203321 |
| River Edge, N.J., : World Scientific, c2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph algorithms and applications 3 / / editors, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
| Graph algorithms and applications 3 / / editors, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, c2004 |
| Descrizione fisica | 1 online resource (412p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
LiottaGiuseppe, Ph. D.
TamassiaRoberto <1960-> TollisIoannis G. <1958-> |
| Soggetto topico |
Graph algorithms
Graph theory |
| ISBN |
1-281-95599-X
9786611955991 981-279-660-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Volume 6:1 (2002). Special issue on graph drawing and representations: selected papers from the 1999 symposium on graph drawing. Guest editors: Hubert de Praysseix and Jan Kratochvil. Guest editors' foreword / Hubert de Fraysseix and Jan Kratochvil. Triangle-free planar graphs and segment intersection graphs / Natalia de Castro ... [et al.]. Communicated by Hubert de Fraysseix and Jan Kratochvil. Planar graphs with topological constraints / Christoph Dornheim. Communicated by Hubert de Fraysseix and Jan Kratochvil. Level planar embedding in linear time / Michael Jünger and Sebastian Leipert. Communicated by Hubert de Fraysseix and Jan Kratochvil. Embedding vertices at points: few bends suffice for planar graphs / Michael Kaufmann and Roland Wiese. Communicated by Hubert de Fraysseix and Jan Kratochvil. Art of graph drawing and art / Jaroslav Nešetřil. Communicated by Hubert de Fraysseix and Jan Kratochvil. Realization of Posets / Patrice Ossona de Mendez. Communicated by Hubert de Fraysseix and Jan Kratochvil -- Volume 6:2 (2002). Traversing directed Eulerian mazes / S. Bhatt ... [et al.]. Communicated by Samir Khuller -- Volume 6:3 (2002). Special issue on selected papers from the 2000 symposium on graph drawing. Guest editors: Michael Kaufmann. Guest editor's foreword / Michael Kaufmann. A fast multi-scale method for drawing large graphs / David Harel and Yehuda Koren. Communicated by Michael Kaufmann. GRIP: graph drawing with intelligent placement / Pawel Gajer and Stephen G. Kobourov. Communicated by Michael Kaufmann. A user study in similarity measures for graph drawing / Stina Bridgeman and Roberto Tamassia. Communicated by Michael Kaufmann. Graph layout aesthetics in UML diagrams: user preferences / Helen C. Purchase, Jo-Anne Allder and David Carrington. Communicated by Michael Kaufmann. Visualization of the high level structure of the internet with Hermes / Andrea Carmignani ... [et al.]. Communicated by Michael Kaufmann. A framework for the static and interactive visualization of statecharts / Rodolfo Castelló, Rym Mili and Ioannis G. Tollis. Communicated by Michael Kaufmann. Graph drawing in motion / Carsten Friedrich and Peter Eades. Communicated by Michael Kaufmann -- Volume 6:4 (2002). A 6-regular Torus graph family with applications to cellular and interconnection networks / Mihaela Iridon and David W. Matula. Communicated by Balaji Raghavachari. |
| Altri titoli varianti | Graph algorithms and applications three |
| Record Nr. | UNINA-9910813734303321 |
| River Edge, N.J., : World Scientific, c2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph algorithms and applications 4 [[electronic resource] /] / editors, Giuseppe Liotta, Roberto Tamassia, Iaonnis G Tollis
| Graph algorithms and applications 4 [[electronic resource] /] / editors, Giuseppe Liotta, Roberto Tamassia, Iaonnis G Tollis |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, N.J., : World Scientific, c2006 |
| Descrizione fisica | 1 online resource (439 p.) |
| Disciplina | 005.133 |
| Altri autori (Persone) |
LiottaGiuseppe
TamassiaRoberto <1960-> TollisIoannis G. <1958-> |
| Soggetto topico |
Graph algorithms
Graph theory |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-92467-9
9786611924676 981-277-329-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Contents ; Volume 7:1 (2003) ; Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry ; Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings ; Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
Volume 7:2 (2003) Advances in Graph Algorithms Special Issue on Selected Papers from the Seventh International Workshop on Algorithms and Data Structures WADS 2001 ; Guest Editors' Foreword ; On External-Memory Planar Depth First Search Small Maximal Independent Sets and Faster Exact Graph Coloring Deciding Clique-Width for Graphs of Bounded Tree-Width ; Visual Ranking of Link Structures ; An Approach for Mixed Upward Planarization ; Upward Embeddings and Orientations of Undirected Planar Graphs ; Volume 7:3 (2003) Crossing Numbers and Cutwidths A Multilevel Algorithm for Force-Directed Graph-Drawing ; Finding Shortest Paths With Computational Geometry ; Volume 7:4 (2003) ; Advances in Graph Drawing Special Issue on Selected Papers from the Ninth International Symposium on Graph Drawing GD 2001 Guest Editors' Foreword Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution ; Orthogonal Drawings of Plane Graphs Without Bends ; Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions ; Low-Distortion Embeddings of Trees On Cotree-Critical and DFS Cotree-Critical Graphs |
| Record Nr. | UNINA-9910450830203321 |
| Singapore ; ; Hackensack, N.J., : World Scientific, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph algorithms and applications 4 [[electronic resource] /] / editors, Giuseppe Liotta, Roberto Tamassia, Iaonnis G Tollis
| Graph algorithms and applications 4 [[electronic resource] /] / editors, Giuseppe Liotta, Roberto Tamassia, Iaonnis G Tollis |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, N.J., : World Scientific, c2006 |
| Descrizione fisica | 1 online resource (439 p.) |
| Disciplina | 005.133 |
| Altri autori (Persone) |
LiottaGiuseppe
TamassiaRoberto <1960-> TollisIoannis G. <1958-> |
| Soggetto topico |
Graph algorithms
Graph theory |
| ISBN |
1-281-92467-9
9786611924676 981-277-329-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Contents ; Volume 7:1 (2003) ; Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry ; Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings ; Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
Volume 7:2 (2003) Advances in Graph Algorithms Special Issue on Selected Papers from the Seventh International Workshop on Algorithms and Data Structures WADS 2001 ; Guest Editors' Foreword ; On External-Memory Planar Depth First Search Small Maximal Independent Sets and Faster Exact Graph Coloring Deciding Clique-Width for Graphs of Bounded Tree-Width ; Visual Ranking of Link Structures ; An Approach for Mixed Upward Planarization ; Upward Embeddings and Orientations of Undirected Planar Graphs ; Volume 7:3 (2003) Crossing Numbers and Cutwidths A Multilevel Algorithm for Force-Directed Graph-Drawing ; Finding Shortest Paths With Computational Geometry ; Volume 7:4 (2003) ; Advances in Graph Drawing Special Issue on Selected Papers from the Ninth International Symposium on Graph Drawing GD 2001 Guest Editors' Foreword Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution ; Orthogonal Drawings of Plane Graphs Without Bends ; Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions ; Low-Distortion Embeddings of Trees On Cotree-Critical and DFS Cotree-Critical Graphs |
| Record Nr. | UNINA-9910784727903321 |
| Singapore ; ; Hackensack, N.J., : World Scientific, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph algorithms and applications 4 / / editors, Giuseppe Liotta, Roberto Tamassia, Iaonnis G Tollis
| Graph algorithms and applications 4 / / editors, Giuseppe Liotta, Roberto Tamassia, Iaonnis G Tollis |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, N.J., : World Scientific, c2006 |
| Descrizione fisica | 1 online resource (439 p.) |
| Disciplina | 005.133 |
| Altri autori (Persone) |
LiottaGiuseppe
TamassiaRoberto <1960-> TollisIoannis G. <1958-> |
| Soggetto topico |
Graph algorithms
Graph theory |
| ISBN |
1-281-92467-9
9786611924676 981-277-329-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Contents ; Volume 7:1 (2003) ; Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry ; Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings ; Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
Volume 7:2 (2003) Advances in Graph Algorithms Special Issue on Selected Papers from the Seventh International Workshop on Algorithms and Data Structures WADS 2001 ; Guest Editors' Foreword ; On External-Memory Planar Depth First Search Small Maximal Independent Sets and Faster Exact Graph Coloring Deciding Clique-Width for Graphs of Bounded Tree-Width ; Visual Ranking of Link Structures ; An Approach for Mixed Upward Planarization ; Upward Embeddings and Orientations of Undirected Planar Graphs ; Volume 7:3 (2003) Crossing Numbers and Cutwidths A Multilevel Algorithm for Force-Directed Graph-Drawing ; Finding Shortest Paths With Computational Geometry ; Volume 7:4 (2003) ; Advances in Graph Drawing Special Issue on Selected Papers from the Ninth International Symposium on Graph Drawing GD 2001 Guest Editors' Foreword Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution ; Orthogonal Drawings of Plane Graphs Without Bends ; Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions ; Low-Distortion Embeddings of Trees On Cotree-Critical and DFS Cotree-Critical Graphs |
| Altri titoli varianti |
Graph algorithms and applications four
Graph algorithms & applications 4 |
| Record Nr. | UNINA-9910812727903321 |
| Singapore ; ; Hackensack, N.J., : World Scientific, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph algorithms and applications 5 [[electronic resource] /] / editors, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
| Graph algorithms and applications 5 [[electronic resource] /] / editors, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, N.J., : World Scientific, c2006 |
| Descrizione fisica | 1 online resource (378 p.) |
| Disciplina | 005.133 |
| Altri autori (Persone) |
LiottaGiuseppe
TamassiaRoberto <1960-> TollisIoannis G. <1958-> |
| Soggetto topico |
Graph algorithms
Graph theory |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-92466-0
9786611924669 981-277-328-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Contents ; Volume 8:1 (2004) ; Drawing Planar Graphs with Large Vertices and Thick Edges ; The Maximum Number of Edges in a Three-Dimensional Grid-Drawing ; Extreme Distances in Multicolored Point Sets ; Fast Approximation of Centrality ; I/O-Optimal Algorithms for Outerplanar Graphs
A Note on Rectilinearity and Angular Resolution The Star Clustering Algorithm for Static and Dynamic Information Organization ; Volume 8:2 (2004) ; Special Issue on Selected Papers from the Tenth International Symposium on Graph Drawing GD 2002 Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio Drawing Graphs on Two and Three Lines. Sabine Cornelsen Thomas Schank and Dorothea Wagner ; Simple and Efficient Bilayer Cross Counting. Wilhelm Barth Petra Mutzel and Michael Jiinger Graph Drawing by High-Dimensional Embedding Computing and Drawing Isomorphic Subgraphs ; Volume 8:3 (2004) ; On the Cutting Edge: Simplified O(n) Planarity by Edge Addition ; Algorithms for Single Link Failure Recovery and Related Problems NP-Completeness of Minimal Width Unordered Tree Layout Algorithm and Experiments in Testing Planar Graphs for Isomorphism ; Three-Dimensional 1-Bend Graph Drawings |
| Record Nr. | UNINA-9910450789603321 |
| Singapore ; ; Hackensack, N.J., : World Scientific, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
