top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
WALCOM: Algorithms and Computation [[electronic resource] ] : 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017, Proceedings / / edited by Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen
WALCOM: Algorithms and Computation [[electronic resource] ] : 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017, Proceedings / / edited by Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen
Edizione [1st ed. 2017.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Descrizione fisica 1 online resource (XXII, 474 p. 109 illus.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Numerical analysis
Computer graphics
Discrete Mathematics in Computer Science
Numerical Analysis
Mathematical Applications in Computer Science
Computer Graphics
ISBN 3-319-53925-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited talks -- Computational geometry -- Combinatorial optimization -- Graph drawing -- Graph algorithms -- Space-efficient algorithms -- Computational complexity -- Approximation algorithms.
Record Nr. UNINA-9910483544403321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
WALCOM: Algorithms and Computation [[electronic resource] ] : 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings / / edited by Mohammad Kaykobad, Rossella Petreschi
WALCOM: Algorithms and Computation [[electronic resource] ] : 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings / / edited by Mohammad Kaykobad, Rossella Petreschi
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (XIX, 362 p. 82 illus. in color.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Computer graphics
Discrete Mathematics in Computer Science
Mathematical Applications in Computer Science
Symbolic and Algebraic Manipulation
Computer Graphics
ISBN 3-319-30139-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996466027703316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
WALCOM: Algorithms and Computation [[electronic resource] ] : 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings / / edited by Mohammad Kaykobad, Rossella Petreschi
WALCOM: Algorithms and Computation [[electronic resource] ] : 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings / / edited by Mohammad Kaykobad, Rossella Petreschi
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (XIX, 362 p. 82 illus. in color.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Computer graphics
Discrete Mathematics in Computer Science
Mathematical Applications in Computer Science
Symbolic and Algebraic Manipulation
Computer Graphics
ISBN 3-319-30139-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910484174903321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
WALCOM: Algorithms and Computation [[electronic resource] ] : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings / / edited by M. Sohel Rahman, Etsuji Tomita
WALCOM: Algorithms and Computation [[electronic resource] ] : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings / / edited by M. Sohel Rahman, Etsuji Tomita
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XXIV, 336 p. 110 illus.)
Disciplina 004
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Computer graphics
Discrete Mathematics in Computer Science
Mathematical Applications in Computer Science
Symbolic and Algebraic Manipulation
Computer Graphics
ISBN 3-319-15612-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Encoding Data Structures -- Fast Algorithms for Constrained Graph Density Problems -- The Directed Ring Loading with Penalty Cost -- Edge-Colorings of Weighted Graphs (Extended Abstract) -- Unit Covering in Color-Spanning Set Model -- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem -- A Practical Succinct Data Structure for Tree-Like Graphs -- Forming Plurality at Minimum Cost -- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs -- Straight-Path Queries in Trajectory Data -- Folding a Paper Strip to Minimize Thickness -- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract) -- PTAS’s for Some Metric p-source Communication Spanning Tree Problems -- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement -- Enumerating Eulerian Trails via Hamiltonian Path Enumeration -- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees -- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks -- Dynamic Online Multiselection in Internal and External Memory -- Competitive Analysis for Multi-objective Online Algorithms -- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends -- An Improved Algorithm for Parameterized Edge Dominating Set Problem -- On Bar (1, j)-Visibility Graphs (Extended Abstract) -- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs -- Non-repetitive Strings over Alphabet Lists -- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes -- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid -- Threshold Circuits for Global Patterns in 2-Dimensional Maps -- Superset Generation on Decision Diagrams -- On Triangle Cover Contact Graphs -- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs.
Record Nr. UNISA-996198744003316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
WALCOM: Algorithms and Computation [[electronic resource] ] : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings / / edited by M. Sohel Rahman, Etsuji Tomita
WALCOM: Algorithms and Computation [[electronic resource] ] : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings / / edited by M. Sohel Rahman, Etsuji Tomita
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XXIV, 336 p. 110 illus.)
Disciplina 004
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Computer graphics
Discrete Mathematics in Computer Science
Mathematical Applications in Computer Science
Symbolic and Algebraic Manipulation
Computer Graphics
ISBN 3-319-15612-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Encoding Data Structures -- Fast Algorithms for Constrained Graph Density Problems -- The Directed Ring Loading with Penalty Cost -- Edge-Colorings of Weighted Graphs (Extended Abstract) -- Unit Covering in Color-Spanning Set Model -- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem -- A Practical Succinct Data Structure for Tree-Like Graphs -- Forming Plurality at Minimum Cost -- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs -- Straight-Path Queries in Trajectory Data -- Folding a Paper Strip to Minimize Thickness -- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract) -- PTAS’s for Some Metric p-source Communication Spanning Tree Problems -- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement -- Enumerating Eulerian Trails via Hamiltonian Path Enumeration -- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees -- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks -- Dynamic Online Multiselection in Internal and External Memory -- Competitive Analysis for Multi-objective Online Algorithms -- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends -- An Improved Algorithm for Parameterized Edge Dominating Set Problem -- On Bar (1, j)-Visibility Graphs (Extended Abstract) -- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs -- Non-repetitive Strings over Alphabet Lists -- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes -- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid -- Threshold Circuits for Global Patterns in 2-Dimensional Maps -- Superset Generation on Decision Diagrams -- On Triangle Cover Contact Graphs -- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs.
Record Nr. UNINA-9910484540503321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
WALCOM: Algorithms and Computation [[electronic resource] ] : 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013, Proceedings / / edited by Subir Kumar Ghosh, Takeshi Tokuyama
WALCOM: Algorithms and Computation [[electronic resource] ] : 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013, Proceedings / / edited by Subir Kumar Ghosh, Takeshi Tokuyama
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (XIV, 348 p. 101 illus.)
Disciplina 006.31
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Computer graphics
Discrete Mathematics in Computer Science
Mathematical Applications in Computer Science
Symbolic and Algebraic Manipulation
Computer Graphics
ISBN 3-642-36064-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Computational Geometry -- Approximation and Randomized Algorithms -- Parallel and Distributed Computing -- Graph Algorithms -- Complexity and Bounds -- Graph Drawing.
Record Nr. UNISA-996465998403316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
WALCOM: Algorithms and Computation [[electronic resource] ] : 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013, Proceedings / / edited by Subir Kumar Ghosh, Takeshi Tokuyama
WALCOM: Algorithms and Computation [[electronic resource] ] : 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013, Proceedings / / edited by Subir Kumar Ghosh, Takeshi Tokuyama
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (XIV, 348 p. 101 illus.)
Disciplina 006.31
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Computer graphics
Discrete Mathematics in Computer Science
Mathematical Applications in Computer Science
Symbolic and Algebraic Manipulation
Computer Graphics
ISBN 3-642-36064-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Computational Geometry -- Approximation and Randomized Algorithms -- Parallel and Distributed Computing -- Graph Algorithms -- Complexity and Bounds -- Graph Drawing.
Record Nr. UNINA-9910739463503321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
WALCOM: Algorithms and Computation [[electronic resource] ] : Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009, Proceedings / / edited by Sandip Das, Ryuhei Uehara
WALCOM: Algorithms and Computation [[electronic resource] ] : Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009, Proceedings / / edited by Sandip Das, Ryuhei Uehara
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (XIII, 408 p.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Numerical analysis
Computer networks
Computer graphics
Bioinformatics
Discrete Mathematics in Computer Science
Numerical Analysis
Computer Communication Networks
Computer Graphics
Computational and Systems Biology
ISBN 3-642-00202-1
Classificazione DAT 530f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talks -- A Separator Theorem for String Graphs and Its Applications -- Foundations of Exact Rounding -- Approximating Shortest Paths in Graphs -- Line Transversals and Pinning Numbers -- Computational Geometry -- Algorithms for Computing Diffuse Reflection Paths in Polygons -- Shortest Gently Descending Paths -- All Farthest Neighbors in the Presence of Highways and Obstacles -- Improved Algorithm for a Widest 1-Corner Corridor -- Maximum Neighbour Voronoi Games -- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem -- Graph Algorithms -- Colinear Coloring on Graphs -- Recursive Generation of 5-Regular Planar Graphs -- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) -- Generating All Triangulations of Plane Graphs (Extended Abstract) -- Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) -- Random Generation and Enumeration of Proper Interval Graphs -- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs -- Minmax Tree Cover in the Euclidean Space -- Network Design with Weighted Degree Constraints -- Minimum Cuts of Simple Graphs in Almost Always Linear Time -- The Generalized Stable Allocation Problem -- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings -- Core and Conditional Core Path of Specified Length in Special Classes of Graphs -- Complexity -- The Planar k-Means Problem is NP-Hard -- On the Computational Complexity of Monotone Constraint Satisfaction Problems -- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane -- Graph Drawing -- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract) -- Matched Drawability of Graph Pairs and of Graph Triples -- An Improved Upward Planarity Testing Algorithm and Related Applications -- Spherical-Rectangular Drawings -- Approximation Algorithms -- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated -- The Minimal Manhattan Network Problem in Three Dimensions -- Randomized Algorithms -- Shape Matching by Random Sampling -- Object Caching for Queries and Updates.
Record Nr. UNISA-996466023903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
WALCOM: Algorithms and Computation [[electronic resource] ] : Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009, Proceedings / / edited by Sandip Das, Ryuhei Uehara
WALCOM: Algorithms and Computation [[electronic resource] ] : Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009, Proceedings / / edited by Sandip Das, Ryuhei Uehara
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (XIII, 408 p.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Numerical analysis
Computer networks
Computer graphics
Bioinformatics
Discrete Mathematics in Computer Science
Numerical Analysis
Computer Communication Networks
Computer Graphics
Computational and Systems Biology
ISBN 3-642-00202-1
Classificazione DAT 530f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talks -- A Separator Theorem for String Graphs and Its Applications -- Foundations of Exact Rounding -- Approximating Shortest Paths in Graphs -- Line Transversals and Pinning Numbers -- Computational Geometry -- Algorithms for Computing Diffuse Reflection Paths in Polygons -- Shortest Gently Descending Paths -- All Farthest Neighbors in the Presence of Highways and Obstacles -- Improved Algorithm for a Widest 1-Corner Corridor -- Maximum Neighbour Voronoi Games -- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem -- Graph Algorithms -- Colinear Coloring on Graphs -- Recursive Generation of 5-Regular Planar Graphs -- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) -- Generating All Triangulations of Plane Graphs (Extended Abstract) -- Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) -- Random Generation and Enumeration of Proper Interval Graphs -- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs -- Minmax Tree Cover in the Euclidean Space -- Network Design with Weighted Degree Constraints -- Minimum Cuts of Simple Graphs in Almost Always Linear Time -- The Generalized Stable Allocation Problem -- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings -- Core and Conditional Core Path of Specified Length in Special Classes of Graphs -- Complexity -- The Planar k-Means Problem is NP-Hard -- On the Computational Complexity of Monotone Constraint Satisfaction Problems -- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane -- Graph Drawing -- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract) -- Matched Drawability of Graph Pairs and of Graph Triples -- An Improved Upward Planarity Testing Algorithm and Related Applications -- Spherical-Rectangular Drawings -- Approximation Algorithms -- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated -- The Minimal Manhattan Network Problem in Three Dimensions -- Randomized Algorithms -- Shape Matching by Random Sampling -- Object Caching for Queries and Updates.
Record Nr. UNINA-9910483544503321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
WALCOM: Algorithms and Computation [[electronic resource] ] : Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008, Proceedings / / edited by Shin-ichi Nakano, Md. Saidur Rahman
WALCOM: Algorithms and Computation [[electronic resource] ] : Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008, Proceedings / / edited by Shin-ichi Nakano, Md. Saidur Rahman
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Descrizione fisica 1 online resource (XII, 244 p.)
Disciplina 511.8
Collana Theoretical Computer Science and General Issues
Soggetto topico Software engineering
Algorithms
Computer science—Mathematics
Discrete mathematics
Numerical analysis
Computer networks
Computer graphics
Software Engineering
Discrete Mathematics in Computer Science
Numerical Analysis
Computer Communication Networks
Computer Graphics
ISBN 3-540-77891-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talks -- Vertex Domination in Dynamic Networks -- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis -- Simple Geometrical Intersection Graphs -- Bioinformatics Algorithms -- On the Approximability of Comparing Genomes with Duplicates -- Indexing Circular Patterns -- A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs -- Computational Geometry and Graph Drawing -- Cover Ratio of Absolute Neighbor -- Computing ?-Drawings of 2-Outerplane Graphs in Linear Time -- Upward Drawings of Trees on the Minimum Number of Layers -- Guarding Exterior Region of a Simple Polygon -- Computing Nice Projections of Convex Polyhedra -- Graph Algorithms I -- A Compact Encoding of Plane Triangulations with Efficient Query Supports -- Four-Connected Spanning Subgraphs of Doughnut Graphs -- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs -- Algorithm Engineering -- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem -- Multi-commodity Source Location Problems and Price of Greed -- Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs -- Optimal Algorithms for Detecting Network Stability -- On Certain New Models for Paging with Locality of Reference -- Graph Algorithms II -- Listing All Plane Graphs -- Pairwise Compatibility Graphs -- Multilevel Bandwidth and Radio Labelings of Graphs.
Record Nr. UNISA-996465630603316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui