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.
Computational geometry and graph theory : international conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007, revised selected papers / / edited by Hiro Ito [and three others]
| Computational geometry and graph theory : international conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007, revised selected papers / / edited by Hiro Ito [and three others] |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2008] |
| Descrizione fisica | 1 online resource (XII, 237 p.) |
| Disciplina | 511/.5 |
| Collana | Image Processing, Computer Vision, Pattern Recognition, and Graphics |
| Soggetto topico |
Geometry - Data processing
Graph theory - Data processing |
| ISBN | 3-540-89550-7 |
| Classificazione |
DAT 537f
MAT 052f MAT 055f SS 4800 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Dudeney Transformation of Normal Tiles -- Chromatic Numbers of Specified Isohedral Tilings -- Transforming Graphs with the Same Degree Sequence -- The Forest Number of (n,m)-Graphs -- Computing Simple Paths on Points in Simple Polygons -- Deflating the Pentagon -- Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry -- Solvable Trees -- Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle -- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets -- Fast Skew Partition Recognition -- Some Results on Fractional Graph Theory -- Seven Types of Random Spherical Triangle in S n and Their Probabilities -- (3,2)-Track Layout of Bipartite Graph Subdivisions -- Bartholdi Zeta Functions of Branched Coverings of Digraphs -- On Super Edge-Magic Strength and Deficiency of Graphs -- The Number of Flips Required to Obtain Non-crossing Convex Cycles -- Divide and Conquer Method for k-Set Polygons -- Coloring Axis-Parallel Rectangles -- Domination in Cubic Graphs of Large Girth -- Chvátal–Erd?s Theorem: Old Theorem with New Aspects -- Computer-Aided Creation of Impossible Objects and Impossible Motions -- The Hamiltonian Number of Cubic Graphs -- SUDOKU Colorings of the Hexagonal Bipyramid Fractal. |
| Record Nr. | UNINA-9910483671203321 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational geometry and graph theory : international conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007, revised selected papers / / edited by Hiro Ito [and three others]
| Computational geometry and graph theory : international conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007, revised selected papers / / edited by Hiro Ito [and three others] |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2008] |
| Descrizione fisica | 1 online resource (XII, 237 p.) |
| Disciplina | 511/.5 |
| Collana | Image Processing, Computer Vision, Pattern Recognition, and Graphics |
| Soggetto topico |
Geometry - Data processing
Graph theory - Data processing |
| ISBN | 3-540-89550-7 |
| Classificazione |
DAT 537f
MAT 052f MAT 055f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Dudeney Transformation of Normal Tiles -- Chromatic Numbers of Specified Isohedral Tilings -- Transforming Graphs with the Same Degree Sequence -- The Forest Number of (n,m)-Graphs -- Computing Simple Paths on Points in Simple Polygons -- Deflating the Pentagon -- Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry -- Solvable Trees -- Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle -- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets -- Fast Skew Partition Recognition -- Some Results on Fractional Graph Theory -- Seven Types of Random Spherical Triangle in S n and Their Probabilities -- (3,2)-Track Layout of Bipartite Graph Subdivisions -- Bartholdi Zeta Functions of Branched Coverings of Digraphs -- On Super Edge-Magic Strength and Deficiency of Graphs -- The Number of Flips Required to Obtain Non-crossing Convex Cycles -- Divide and Conquer Method for k-Set Polygons -- Coloring Axis-Parallel Rectangles -- Domination in Cubic Graphs of Large Girth -- Chvátal–Erd?s Theorem: Old Theorem with New Aspects -- Computer-Aided Creation of Impossible Objects and Impossible Motions -- The Hamiltonian Number of Cubic Graphs -- SUDOKU Colorings of the Hexagonal Bipyramid Fractal. |
| Record Nr. | UNISA-996465425303316 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Theory, Computational Intelligence and Thought [[electronic resource] ] : Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday / / edited by Marina Lipshteyn, Vadim E. Levit, Ross McConnell
| Graph Theory, Computational Intelligence and Thought [[electronic resource] ] : Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday / / edited by Marina Lipshteyn, Vadim E. Levit, Ross McConnell |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (237 p.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Algorithms Machine theory Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer graphics Artificial Intelligence Formal Languages and Automata Theory Discrete Mathematics in Computer Science Data Science Computer Graphics |
| ISBN |
1-282-29777-5
9786612297779 3-642-02029-1 |
| Classificazione |
DAT 357f
MAT 055f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Landmarks in Algorithmic Graph Theory: A Personal Retrospective -- A Higher-Order Graph Calculus for Autonomic Computing -- Algorithms on Subtree Filament Graphs -- A Note on the Recognition of Nested Graphs -- Asynchronous Congestion Games -- Combinatorial Problems for Horn Clauses -- Covering a Tree by a Forest -- Dominating Induced Matchings -- HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results -- Local Search Heuristics for the Multidimensional Assignment Problem -- On Distance-3 Matchings and Induced Matchings -- On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph -- On Path Partitions and Colourings in Digraphs -- On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6 -- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs -- O(m logn) Split Decomposition of Strongly Connected Graphs -- Path-Bicolorable Graphs -- Path Partitions, Cycle Covers and Integer Decomposition -- Properly Coloured Cycles and Paths: Results and Open Problems -- Recognition of Antimatroidal Point Sets -- Tree Projections: Game Characterization and Computational Aspects. |
| Record Nr. | UNISA-996465872603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Theory, Computational Intelligence and Thought : Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday / / edited by Marina Lipshteyn, Vadim E. Levit, Ross McConnell
| Graph Theory, Computational Intelligence and Thought : Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday / / edited by Marina Lipshteyn, Vadim E. Levit, Ross McConnell |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (237 p.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Algorithms Machine theory Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer graphics Artificial Intelligence Formal Languages and Automata Theory Discrete Mathematics in Computer Science Data Science Computer Graphics |
| ISBN |
1-282-29777-5
9786612297779 3-642-02029-1 |
| Classificazione |
DAT 357f
MAT 055f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Landmarks in Algorithmic Graph Theory: A Personal Retrospective -- A Higher-Order Graph Calculus for Autonomic Computing -- Algorithms on Subtree Filament Graphs -- A Note on the Recognition of Nested Graphs -- Asynchronous Congestion Games -- Combinatorial Problems for Horn Clauses -- Covering a Tree by a Forest -- Dominating Induced Matchings -- HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results -- Local Search Heuristics for the Multidimensional Assignment Problem -- On Distance-3 Matchings and Induced Matchings -- On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph -- On Path Partitions and Colourings in Digraphs -- On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6 -- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs -- O(m logn) Split Decomposition of Strongly Connected Graphs -- Path-Bicolorable Graphs -- Path Partitions, Cycle Covers and Integer Decomposition -- Properly Coloured Cycles and Paths: Results and Open Problems -- Recognition of Antimatroidal Point Sets -- Tree Projections: Game Characterization and Computational Aspects. |
| Record Nr. | UNINA-9910483870403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers / / edited by Christophe Paul, Michel Habib
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers / / edited by Christophe Paul, Michel Habib |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIII, 353 p.) |
| Disciplina | 004.015115 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Geometry Algorithms Artificial intelligence—Data processing Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Data Science |
| ISBN |
1-280-38546-4
9786613563385 3-642-11409-1 |
| Classificazione |
DAT 537f
MAT 055f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph-Theoretic Solutions to Computational Geometry Problems -- Algorithms for Classes of Graphs with Bounded Expansion -- A Graph Polynomial Arising from Community Structure (Extended Abstract) -- Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs -- Maximum Series-Parallel Subgraph -- Low-Port Tree Representations -- Fully Dynamic Representations of Interval Graphs -- The Parameterized Complexity of Some Minimum Label Problems -- Exact and Parameterized Algorithms for Max Internal Spanning Tree -- An Exact Algorithm for Minimum Distortion Embedding -- Sub-coloring and Hypo-coloring Interval Graphs -- Parameterized Complexity of Generalized Domination Problems -- Connected Feedback Vertex Set in Planar Graphs -- Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract) -- On Module-Composed Graphs -- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees -- The k-Disjoint Paths Problem on Chordal Graphs -- Local Algorithms for Edge Colorings in UDGs -- Directed Rank-Width and Displit Decomposition -- An Algorithmic Study of Switch Graphs -- Hardness Results and Efficient Algorithms for Graph Powers -- Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph -- Injective Oriented Colourings -- Chordal Digraphs -- A New Intersection Model and Improved Algorithms for Tolerance Graphs -- Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes -- Distance d-Domination Games -- Cycles, Paths, Connectivity and Diameter in Distance Graphs -- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) -- Finding Induced Paths of Given Parity in Claw-Free Graphs. |
| Record Nr. | UNISA-996465915003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-theoretic concepts in computer science : 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009 ; revised papers / / Christophe Paul, Michel Habib (eds.)
| Graph-theoretic concepts in computer science : 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009 ; revised papers / / Christophe Paul, Michel Habib (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2010 |
| Descrizione fisica | 1 online resource (XIII, 353 p.) |
| Disciplina | 004.015115 |
| Altri autori (Persone) |
PaulChristophe
HabibM (Michel) |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Graph theory
Graph algorithms |
| ISBN |
1-280-38546-4
9786613563385 3-642-11409-1 |
| Classificazione |
DAT 537f
MAT 055f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph-Theoretic Solutions to Computational Geometry Problems -- Algorithms for Classes of Graphs with Bounded Expansion -- A Graph Polynomial Arising from Community Structure (Extended Abstract) -- Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs -- Maximum Series-Parallel Subgraph -- Low-Port Tree Representations -- Fully Dynamic Representations of Interval Graphs -- The Parameterized Complexity of Some Minimum Label Problems -- Exact and Parameterized Algorithms for Max Internal Spanning Tree -- An Exact Algorithm for Minimum Distortion Embedding -- Sub-coloring and Hypo-coloring Interval Graphs -- Parameterized Complexity of Generalized Domination Problems -- Connected Feedback Vertex Set in Planar Graphs -- Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract) -- On Module-Composed Graphs -- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees -- The k-Disjoint Paths Problem on Chordal Graphs -- Local Algorithms for Edge Colorings in UDGs -- Directed Rank-Width and Displit Decomposition -- An Algorithmic Study of Switch Graphs -- Hardness Results and Efficient Algorithms for Graph Powers -- Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph -- Injective Oriented Colourings -- Chordal Digraphs -- A New Intersection Model and Improved Algorithms for Tolerance Graphs -- Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes -- Distance d-Domination Games -- Cycles, Paths, Connectivity and Diameter in Distance Graphs -- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) -- Finding Induced Paths of Given Parity in Claw-Free Graphs. |
| Record Nr. | UNINA-9910484753003321 |
| Berlin ; ; New York, : Springer, c2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers / / edited by Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniel Paulusma
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers / / edited by Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniel Paulusma |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIII, 386 p.) |
| Disciplina | 004.015115 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Graphics |
| ISBN | 3-540-92248-2 |
| Classificazione |
DAT 537f
MAT 055f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Contributions -- (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective -- Memory Efficient Anonymous Graph Exploration -- Algorithmic Meta Theorems -- Regular Papers -- A Most General Edge Elimination Polynomial -- Approximating the Metric TSP in Linear Time -- The Valve Location Problem in Simple Network Topologies -- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs -- On the Pseudo-achromatic Number Problem -- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings -- Faster Exact Bandwidth -- Additive Spanners for Circle Graphs and Polygonal Graphs -- Upward Straight-Line Embeddings of Directed Graphs into Point Sets -- Complexity of the Packing Coloring Problem for Trees -- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges -- A Lower Bound on the Area Requirements of Series-Parallel Graphs -- On Independent Sets and Bicliques in Graphs -- Evaluations of Graph Polynomials -- Parameterized Complexity for Domination Problems on Degenerate Graphs -- An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph -- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs -- The Rank-Width of the Square Grid -- Improved Upper Bounds for Partial Vertex Cover -- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width -- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms -- What Is between Chordal and Weakly Chordal Graphs? -- Parameterized Graph Cleaning Problems -- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph -- Fast Robber in Planar Graphs -- From a Circular-Arc Model to a Proper Circular-Arc Model -- Digraph Decompositions and Monotonicity in Digraph Searching -- Searching for a Visible, Lazy Fugitive -- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes -- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. |
| Record Nr. | UNISA-996466367903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers / / edited by Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniel Paulusma
| Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers / / edited by Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniel Paulusma |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIII, 386 p.) |
| Disciplina | 004.015115 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Graphics |
| ISBN | 3-540-92248-2 |
| Classificazione |
DAT 537f
MAT 055f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Contributions -- (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective -- Memory Efficient Anonymous Graph Exploration -- Algorithmic Meta Theorems -- Regular Papers -- A Most General Edge Elimination Polynomial -- Approximating the Metric TSP in Linear Time -- The Valve Location Problem in Simple Network Topologies -- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs -- On the Pseudo-achromatic Number Problem -- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings -- Faster Exact Bandwidth -- Additive Spanners for Circle Graphs and Polygonal Graphs -- Upward Straight-Line Embeddings of Directed Graphs into Point Sets -- Complexity of the Packing Coloring Problem for Trees -- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges -- A Lower Bound on the Area Requirements of Series-Parallel Graphs -- On Independent Sets and Bicliques in Graphs -- Evaluations of Graph Polynomials -- Parameterized Complexity for Domination Problems on Degenerate Graphs -- An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph -- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs -- The Rank-Width of the Square Grid -- Improved Upper Bounds for Partial Vertex Cover -- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width -- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms -- What Is between Chordal and Weakly Chordal Graphs? -- Parameterized Graph Cleaning Problems -- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph -- Fast Robber in Planar Graphs -- From a Circular-Arc Model to a Proper Circular-Arc Model -- Digraph Decompositions and Monotonicity in Digraph Searching -- Searching for a Visible, Lazy Fugitive -- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes -- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. |
| Record Nr. | UNINA-9910483945703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||