Algorithms and Computation [[electronic resource] ] : 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings / / edited by Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIX, 948 p.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Artificial intelligence—Data processing
Computer science Mathematics—Data processing Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Data Science Theory of Computation Computational Mathematics and Numerical Analysis Discrete Mathematics in Computer Science Numerical Analysis |
ISBN | 3-540-92182-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talk -- Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array? -- Some Constrained Notions of Planarity -- Reachability Problems on Directed Graphs -- 1A Approximation Algorithm I -- Greedy Construction of 2-Approximation Minimum Manhattan Network -- The Complexity of Minimum Convex Coloring -- On the Complexity of Reconfiguration Problems -- Multiobjective Disk Cover Admits a PTAS -- 1B Online Algorithm -- Data Stream Algorithms via Expander Graphs -- Improving the Competitive Ratio of the Online OVSF Code Assignment Problem -- Optimal Key Tree Structure for Deleting Two or More Leaves -- Comparing First-Fit and Next-Fit for Online Edge Coloring -- 2A Data Structure and Algorithm -- Selecting Sums in Arrays -- Succinct and I/O Efficient Data Structures for Traversal in Trees -- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation -- Power Domination in Using Reference Search Trees -- 2B Game Theory -- The Isolation Game: A Game of Distances -- On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks -- The Complexity of Rationalizing Matchings -- A Game Theoretic Approach for Efficient Graph Coloring -- 3A Graph Algorithm I -- Partitioning a Weighted Tree to Subtrees of Almost Uniform Size -- An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts -- On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures -- An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem -- The Balanced Edge Cover Problem -- 3B Fixed Parameter Tractability -- Firefighting on Trees: (1???1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm -- A New Algorithm for Finding Trees with Many Leaves -- Faster Parameterized Algorithms for Minimum Fill-In -- Graph Layout Problems Parameterized by Vertex Cover -- A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs -- 4A Distributed Algorithm -- How to Guard a Graph? -- Tree Decontamination with Temporary Immunity -- Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves -- Squaring the Circle with Weak Mobile Robots -- 4B Database -- Evaluation of General Set Expressions -- Computing with Priced Information: When the Value Makes the Price -- Deductive Inference for the Interiors and Exteriors of Horn Theories -- Leaf Powers and Their Properties: Using the Trees -- 5A Approximation Algorithm II -- Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD -- Minimizing Total Flow-Time: The Unrelated Case -- Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects -- Space-Efficient Informational Redundancy -- 5B Computational Biology -- Minkowski Sum Selection and Finding -- Constructing the Simplest Possible Phylogenetic Network from Triplets -- New Results on Optimizing Rooted Triplets Consistency -- A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching -- 6A Computational Geometry I -- Inducing Polygons of Line Arrangements -- Free-Form Surface Partition in 3-D -- Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance -- Preprocessing Imprecise Points and Splitting Triangulations -- Efficient Output-Sensitive Construction of Reeb Graphs -- 6B Complexity I -- Signature Theory in Holographic Algorithms -- The Complexity of SPP Formula Minimization -- Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol -- Negation-Limited Inverters of Linear Size -- 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge -- 7A Computational Geometry II -- A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths -- Detecting Commuting Patterns by Clustering Subtrajectories -- On the Stretch Factor of Convex Delaunay Graphs -- Covering a Simple Polygon by Monotone Directions -- 7B Network -- On the Stability of Web Crawling and Web Search -- Average Update Times for Fully-Dynamic All-Pairs Shortest Paths -- Computing Frequency Dominators and Related Problems -- Computing Best Swaps in Optimal Tree Spanners -- 8A Optimization -- Covering a Point Set by Two Disjoint Rectangles -- Computing the Maximum Detour of a Plane Graph in Subquadratic Time -- Finding Long Paths, Cycles and Circuits -- Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces -- 8B Routing -- On Labeled Traveling Salesman Problems -- Navigating in a Graph by Aid of Its Spanning Tree -- Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times -- Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks -- 9A Graph Algorithm II -- Bandwidth of Bipartite Permutation Graphs -- König Deletion Sets and Vertex Covers above the Matching Size -- Independent Sets of Maximum Weight in Apple-Free Graphs -- Enumeration of Perfect Sequences of Chordal Graph -- From Tree-Width to Clique-Width: Excluding a Unit Interval Graph -- 9B Complexity II -- New Results on the Most Significant Bit of Integer Multiplication -- Sorting with Complete Networks of Stacks -- Quantum Query Complexity of Boolean Functions with Small On-Sets -- Unbounded-Error Quantum Query Complexity -- Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States. |
Record Nr. | UNISA-996465545303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithms and Computation : 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings / / edited by Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIX, 948 p.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Artificial intelligence—Data processing
Computer science Mathematics—Data processing Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Data Science Theory of Computation Computational Mathematics and Numerical Analysis Discrete Mathematics in Computer Science Numerical Analysis |
ISBN | 3-540-92182-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talk -- Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array? -- Some Constrained Notions of Planarity -- Reachability Problems on Directed Graphs -- 1A Approximation Algorithm I -- Greedy Construction of 2-Approximation Minimum Manhattan Network -- The Complexity of Minimum Convex Coloring -- On the Complexity of Reconfiguration Problems -- Multiobjective Disk Cover Admits a PTAS -- 1B Online Algorithm -- Data Stream Algorithms via Expander Graphs -- Improving the Competitive Ratio of the Online OVSF Code Assignment Problem -- Optimal Key Tree Structure for Deleting Two or More Leaves -- Comparing First-Fit and Next-Fit for Online Edge Coloring -- 2A Data Structure and Algorithm -- Selecting Sums in Arrays -- Succinct and I/O Efficient Data Structures for Traversal in Trees -- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation -- Power Domination in Using Reference Search Trees -- 2B Game Theory -- The Isolation Game: A Game of Distances -- On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks -- The Complexity of Rationalizing Matchings -- A Game Theoretic Approach for Efficient Graph Coloring -- 3A Graph Algorithm I -- Partitioning a Weighted Tree to Subtrees of Almost Uniform Size -- An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts -- On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures -- An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem -- The Balanced Edge Cover Problem -- 3B Fixed Parameter Tractability -- Firefighting on Trees: (1???1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm -- A New Algorithm for Finding Trees with Many Leaves -- Faster Parameterized Algorithms for Minimum Fill-In -- Graph Layout Problems Parameterized by Vertex Cover -- A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs -- 4A Distributed Algorithm -- How to Guard a Graph? -- Tree Decontamination with Temporary Immunity -- Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves -- Squaring the Circle with Weak Mobile Robots -- 4B Database -- Evaluation of General Set Expressions -- Computing with Priced Information: When the Value Makes the Price -- Deductive Inference for the Interiors and Exteriors of Horn Theories -- Leaf Powers and Their Properties: Using the Trees -- 5A Approximation Algorithm II -- Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD -- Minimizing Total Flow-Time: The Unrelated Case -- Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects -- Space-Efficient Informational Redundancy -- 5B Computational Biology -- Minkowski Sum Selection and Finding -- Constructing the Simplest Possible Phylogenetic Network from Triplets -- New Results on Optimizing Rooted Triplets Consistency -- A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching -- 6A Computational Geometry I -- Inducing Polygons of Line Arrangements -- Free-Form Surface Partition in 3-D -- Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance -- Preprocessing Imprecise Points and Splitting Triangulations -- Efficient Output-Sensitive Construction of Reeb Graphs -- 6B Complexity I -- Signature Theory in Holographic Algorithms -- The Complexity of SPP Formula Minimization -- Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol -- Negation-Limited Inverters of Linear Size -- 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge -- 7A Computational Geometry II -- A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths -- Detecting Commuting Patterns by Clustering Subtrajectories -- On the Stretch Factor of Convex Delaunay Graphs -- Covering a Simple Polygon by Monotone Directions -- 7B Network -- On the Stability of Web Crawling and Web Search -- Average Update Times for Fully-Dynamic All-Pairs Shortest Paths -- Computing Frequency Dominators and Related Problems -- Computing Best Swaps in Optimal Tree Spanners -- 8A Optimization -- Covering a Point Set by Two Disjoint Rectangles -- Computing the Maximum Detour of a Plane Graph in Subquadratic Time -- Finding Long Paths, Cycles and Circuits -- Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces -- 8B Routing -- On Labeled Traveling Salesman Problems -- Navigating in a Graph by Aid of Its Spanning Tree -- Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times -- Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks -- 9A Graph Algorithm II -- Bandwidth of Bipartite Permutation Graphs -- König Deletion Sets and Vertex Covers above the Matching Size -- Independent Sets of Maximum Weight in Apple-Free Graphs -- Enumeration of Perfect Sequences of Chordal Graph -- From Tree-Width to Clique-Width: Excluding a Unit Interval Graph -- 9B Complexity II -- New Results on the Most Significant Bit of Integer Multiplication -- Sorting with Complete Networks of Stacks -- Quantum Query Complexity of Boolean Functions with Small On-Sets -- Unbounded-Error Quantum Query Complexity -- Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States. |
Record Nr. | UNINA-9910484503603321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Asia-Pacific Symposium on Visualisation, 2007 : Sydney, NSW, Australia, February 5-7, 2007 : proceedings / / edited by Seok-Hee Hong, Kwan-Liu Ma ; sponsored by IEEE Computer Society Visualization and Graphics Technical Committee |
Pubbl/distr/stampa | IEEE |
Disciplina | 001.4/226028566 |
Altri autori (Persone) |
HongSeok-Hee
MaKwan-liu |
Soggetto topico |
Information visualization
Computer graphics Information display systems |
ISBN | 1-5090-8711-7 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti |
Web Services
2007 6th International Asia-Pacific Symposium on Visualization |
Record Nr. | UNISA-996201764003316 |
IEEE | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Asia-Pacific Symposium on Visualisation, 2007 : Sydney, NSW, Australia, February 5-7, 2007 : proceedings / / edited by Seok-Hee Hong, Kwan-Liu Ma ; sponsored by IEEE Computer Society Visualization and Graphics Technical Committee |
Pubbl/distr/stampa | IEEE |
Disciplina | 001.4/226028566 |
Altri autori (Persone) |
HongSeok-Hee
MaKwan-liu |
Soggetto topico |
Information visualization
Computer graphics Information display systems |
ISBN | 1-5090-8711-7 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti |
Web Services
2007 6th International Asia-Pacific Symposium on Visualization |
Record Nr. | UNINA-9910143034803321 |
IEEE | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Beyond planar graphs : communications of NII Shonan meetings / / Seok-Hee Hong, Takeshi Tokuyama, editors |
Edizione | [1st ed. 2020.] |
Pubbl/distr/stampa | Gateway East, Singapore : , : Springer, , [2020] |
Descrizione fisica | 1 online resource (VIII, 270 p. 130 illus., 48 illus. in color.) |
Disciplina | 511.5 |
Soggetto topico | Graph algorithms |
ISBN | 981-15-6533-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Chapter 1: Introduction -- Chapter 2: Quantitative Restrictions on Crossing Patterns -- Chapter 3: Quasi-planar Graphs -- Chapter 4: 1-Planar Graphs -- Chapter 5: Algorithms for 1-planar Graphs -- Chapter 6:^= 2 -- Chapter 8: Fan-Planarity -- Chapter 9: Right Angle Crossing Drawings of Graphs -- Chapter 10: Angular Resolutions -- Chapter 11: Crossing Layout in Non-Planar Graph Drawings -- Chapter 12: Beyond Clustered Planarity -- Chapter: Simultaneous Embedding. . |
Record Nr. | UNISA-996465363403316 |
Gateway East, Singapore : , : Springer, , [2020] | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Beyond planar graphs : communications of NII Shonan meetings / / Seok-Hee Hong, Takeshi Tokuyama, editors |
Edizione | [1st ed. 2020.] |
Pubbl/distr/stampa | Gateway East, Singapore : , : Springer, , [2020] |
Descrizione fisica | 1 online resource (VIII, 270 p. 130 illus., 48 illus. in color.) |
Disciplina | 511.5 |
Soggetto topico | Graph algorithms |
ISBN | 981-15-6533-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Chapter 1: Introduction -- Chapter 2: Quantitative Restrictions on Crossing Patterns -- Chapter 3: Quasi-planar Graphs -- Chapter 4: 1-Planar Graphs -- Chapter 5: Algorithms for 1-planar Graphs -- Chapter 6:^= 2 -- Chapter 8: Fan-Planarity -- Chapter 9: Right Angle Crossing Drawings of Graphs -- Chapter 10: Angular Resolutions -- Chapter 11: Crossing Layout in Non-Planar Graph Drawings -- Chapter 12: Beyond Clustered Planarity -- Chapter: Simultaneous Embedding. . |
Record Nr. | UNINA-9910427694203321 |
Gateway East, Singapore : , : Springer, , [2020] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Graph Drawing [[electronic resource] ] : 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers / / edited by Seok-Hee Hong, Takao Nishizeki, Wu Quan |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIII, 401 p.) |
Disciplina | 511.5 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Computer graphics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Computer Graphics Data Science |
ISBN | 3-540-77537-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Computing Symmetries of Combinatorial Objects -- Large-Scale Graphics: Digital Nature and Laser Projection -- Papers -- Crossing Number of Graphs with Rotation Systems -- A Bipartite Strengthening of the Crossing Lemma -- Improvement on the Decay of Crossing Numbers -- Crossing Numbers and Parameterized Complexity -- Characterization of Unlabeled Level Planar Graphs -- Cyclic Level Planarity Testing and Embedding -- Practical Level Planarity Testing and Layout with Embedding Constraints -- Minimum Level Nonplanar Patterns for Trees -- Straight-Line Orthogonal Drawings of Binary and Ternary Trees -- Polynomial Area Bounds for MST Embeddings of Trees -- Moving Vertices to Make Drawings Plane -- Point-Set Embedding of Trees with Edge Constraints -- Representation of Planar Hypergraphs by Contacts of Triangles -- The Complexity of Several Realizability Problems for Abstract Topological Graphs -- Efficient Extraction of Multiple Kuratowski Subdivisions -- Cover Contact Graphs -- Matched Drawings of Planar Graphs -- Maximum Upward Planar Subgraphs of Embedded Planar Digraphs -- Minimizing the Area for Planar Straight-Line Grid Drawings -- On Planar Polyline Drawings -- Constrained Stress Majorization Using Diagonally Scaled Gradient Projection -- Line Crossing Minimization on Metro Maps -- Algorithms for Multi-criteria One-Sided Boundary Labeling -- Multi-circular Layout of Micro/Macro Graphs -- Constrained Simultaneous and Near-Simultaneous Embeddings -- Simultaneous Geometric Graph Embeddings -- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces -- Clustered Planarity: Small Clusters in Eulerian Graphs -- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge -- Colorability in Orthogonal Graph Drawing -- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs -- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices -- LunarVis – Analytic Visualizations of Large Graphs -- Visualizing Internet Evolution on the Autonomous Systems Level -- Treemaps for Directed Acyclic Graphs -- Drawing Graphs with GLEE -- Graph Drawing Contest -- Graph Drawing Contest Report. |
Record Nr. | UNISA-996465775603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Graph Drawing : 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers / / edited by Seok-Hee Hong, Takao Nishizeki, Wu Quan |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIII, 401 p.) |
Disciplina | 511.5 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Computer graphics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Computer Graphics Data Science |
ISBN | 3-540-77537-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Computing Symmetries of Combinatorial Objects -- Large-Scale Graphics: Digital Nature and Laser Projection -- Papers -- Crossing Number of Graphs with Rotation Systems -- A Bipartite Strengthening of the Crossing Lemma -- Improvement on the Decay of Crossing Numbers -- Crossing Numbers and Parameterized Complexity -- Characterization of Unlabeled Level Planar Graphs -- Cyclic Level Planarity Testing and Embedding -- Practical Level Planarity Testing and Layout with Embedding Constraints -- Minimum Level Nonplanar Patterns for Trees -- Straight-Line Orthogonal Drawings of Binary and Ternary Trees -- Polynomial Area Bounds for MST Embeddings of Trees -- Moving Vertices to Make Drawings Plane -- Point-Set Embedding of Trees with Edge Constraints -- Representation of Planar Hypergraphs by Contacts of Triangles -- The Complexity of Several Realizability Problems for Abstract Topological Graphs -- Efficient Extraction of Multiple Kuratowski Subdivisions -- Cover Contact Graphs -- Matched Drawings of Planar Graphs -- Maximum Upward Planar Subgraphs of Embedded Planar Digraphs -- Minimizing the Area for Planar Straight-Line Grid Drawings -- On Planar Polyline Drawings -- Constrained Stress Majorization Using Diagonally Scaled Gradient Projection -- Line Crossing Minimization on Metro Maps -- Algorithms for Multi-criteria One-Sided Boundary Labeling -- Multi-circular Layout of Micro/Macro Graphs -- Constrained Simultaneous and Near-Simultaneous Embeddings -- Simultaneous Geometric Graph Embeddings -- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces -- Clustered Planarity: Small Clusters in Eulerian Graphs -- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge -- Colorability in Orthogonal Graph Drawing -- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs -- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices -- LunarVis – Analytic Visualizations of Large Graphs -- Visualizing Internet Evolution on the Autonomous Systems Level -- Treemaps for Directed Acyclic Graphs -- Drawing Graphs with GLEE -- Graph Drawing Contest -- Graph Drawing Contest Report. |
Record Nr. | UNINA-9910767534503321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
WALCOM: Algorithms and Computation [[electronic resource] ] : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings / / edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy |
Edizione | [1st ed. 2021.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
Descrizione fisica | 1 online resource (XV, 334 p. 108 illus., 55 illus. in color.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Computer graphics Application software Theory of Computation Data Structures and Information Theory Discrete Mathematics in Computer Science Computer Graphics Computer and Information Systems Applications |
ISBN | 3-030-68211-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited talks -- Majority Spanning Trees, Cotrees and Their Applications -- New Transportation Problem on a Graph with Sending and Bringing-Back Operations -- Long papers -- Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees -- On Short Fastest Paths in Temporal Graphs -- Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights -- The Bike Sharing Problem -- Efficient Generation of a Card-based Uniformly Distributed Random Derangement -- Compact Data Structures for Dedekind Groups and Finite Rings -- Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game -- Faster Multi-Sided Boundary Labelling -- On the Geometric Red-Blue Set Cover Problem -- Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes -- $r$-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes -- An Improvement of Reed's Treewidth Approximation -- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs -- Overall and delay complexity of the CLIQUESand Bron-Kerbosch algorithms -- Computing $L(p,1)$-Labeling with Combined Parameters -- On Compatible Matchings -- Upward Point Set Embeddings of Paths and Trees -- 2-colored Point-set Embeddings of Partial 2-trees -- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs -- APX-Hardness and Approximation for the $k$-Burning Number Problem -- Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs -- Physical Zero-Knowledge Proof for Ripple Effect -- Cyclic Shift Problems on Graphs -- Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles. |
Record Nr. | UNISA-996464530003316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
WALCOM: Algorithms and Computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings / / edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy |
Edizione | [1st ed. 2021.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
Descrizione fisica | 1 online resource (XV, 334 p. 108 illus., 55 illus. in color.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Computer graphics Application software Theory of Computation Data Structures and Information Theory Discrete Mathematics in Computer Science Computer Graphics Computer and Information Systems Applications |
ISBN | 3-030-68211-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited talks -- Majority Spanning Trees, Cotrees and Their Applications -- New Transportation Problem on a Graph with Sending and Bringing-Back Operations -- Long papers -- Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees -- On Short Fastest Paths in Temporal Graphs -- Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights -- The Bike Sharing Problem -- Efficient Generation of a Card-based Uniformly Distributed Random Derangement -- Compact Data Structures for Dedekind Groups and Finite Rings -- Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game -- Faster Multi-Sided Boundary Labelling -- On the Geometric Red-Blue Set Cover Problem -- Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes -- $r$-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes -- An Improvement of Reed's Treewidth Approximation -- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs -- Overall and delay complexity of the CLIQUESand Bron-Kerbosch algorithms -- Computing $L(p,1)$-Labeling with Combined Parameters -- On Compatible Matchings -- Upward Point Set Embeddings of Paths and Trees -- 2-colored Point-set Embeddings of Partial 2-trees -- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs -- APX-Hardness and Approximation for the $k$-Burning Number Problem -- Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs -- Physical Zero-Knowledge Proof for Ripple Effect -- Cyclic Shift Problems on Graphs -- Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles. |
Record Nr. | UNINA-9910483831703321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|