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.
Combinatorial algorithms : 20th International Workshop, IWOCA 2009, Hradec nad Moravici, Czech Republic, June 28-July 2, 2009 ; revised selected papers / / Jiri Fiala, Jan Kratochvil, Mirka Miller (eds.)
| Combinatorial algorithms : 20th International Workshop, IWOCA 2009, Hradec nad Moravici, Czech Republic, June 28-July 2, 2009 ; revised selected papers / / Jiri Fiala, Jan Kratochvil, Mirka Miller (eds.) |
| Autore | Fiala Jiri |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XII, 480 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
MillerMirka
KratochvilJan |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer software
Computer science Computational complexity Combinatorial analysis Algebra - Data processing Coding theory |
| ISBN | 3-642-10217-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Branching Systems -- Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology -- Succinct Representations of Trees -- Kt Minors in Large t-Connected Graphs -- Intractability in Graph Drawing and Geometry: FPT Approaches -- Contributed Talks -- Evaluation of Recoverable-Robust Timetables on Tree Networks -- Weighted LCS -- Integrality Properties of Certain Special Balanceable Families -- Forbidden Subgraph Colorings and the Oriented Chromatic Number -- Polynomial Kernels for 3-Leaf Power Graph Modification Problems -- Approximating the Max Edge-Coloring Problem -- Three Complexity Results on Coloring P k -Free Graphs -- Fully Decomposable Split Graphs -- Feedback Vertex Set on Graphs of Low Cliquewidth -- Note on Decomposition of K n,n into (0,j)-prisms -- Edge-Simple Circuits through 10 Ordered Vertices in Square Grids -- Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search -- LPF Computation Revisited -- Limiting Distribution for Distances in k-Trees -- Gray Code Compression -- Embedded Trees and the Support of the ISE -- Combinatorial Models for Cooperation Networks -- Polar Permutation Graphs -- A New Algorithm for Efficient Pattern Matching with Swaps -- The Height and Range of Watermelons without Wall -- Fast Convolutions and Their Applications in Approximate String Matching -- Better Polynomial Algorithms on Graphs of Bounded Rank-Width -- Minimax Trees in Linear Time with Applications -- Planar Biconnectivity Augmentation with Fixed Embedding -- Trivially-Perfect Width -- Lightweight Parameterized Suffix Array Construction -- On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices -- Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees -- On the Maximal Number of Cubic Subwords in a String -- Solution of Peter Winkler’s Pizza Problem -- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs -- Simpler Parameterized Algorithm for OCT -- Bipartite Graphs of Large Clique-Width -- Kernel in Oriented Circulant Graphs -- Randomized Postoptimization of Covering Arrays -- New Word-Based Adaptive Dense Compressors -- Rainbow Connection in Graphs with Minimum Degree Three -- The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree -- Computability of Width of Submodular Partition Functions -- The Guarding Problem – Complexity and Approximation -- Antibandwidth of d-Dimensional Meshes. |
| Record Nr. | UNINA-9910484999503321 |
Fiala Jiri
|
||
| Berlin, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers / / edited by Kratochvíl Jan, Mirka Miller, Dalibor Froncek
| Combinatorial Algorithms [[electronic resource] ] : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers / / edited by Kratochvíl Jan, Mirka Miller, Dalibor Froncek |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XIII, 377 p. 70 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Machine theory Artificial intelligence—Data processing Bioinformatics Discrete Mathematics in Computer Science Discrete Mathematics Formal Languages and Automata Theory Data Science Computational and Systems Biology |
| ISBN | 3-319-19315-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism -- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem -- Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk -- On the Galois Lattice of Bipartite Distance Hereditary Graphs -- Fast Simple Computations Using Prefix Tables under Hamming and Edit Distance -- Border Correlations, Lattices and the Subgraph Component Polynomial -- Computing Minimum Length Representations of Sets of Words of Uniform Length -- Computing Primitively-Rooted Squares and Runs in Partial Words -- 3-coloring triangle-free planar graphs with a precolored 9-cycle -- Computing Heat Kernel Pagerank and a Local Clustering Algorithm -- Solving Matching Problems Efficiently in Bipartite Graphs -- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras -- On decomposing the complete graph into the union of two disjoint cycles -- Reconfiguration of Vertex Covers in a Graph -- Space Efficient Data Structures for Nearest Larger Neighbor Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory -- On Maximum Common Subgraph Problems in Series-Parallel Graphs -- Profile-based optimal matchings in the Student/Project Allocation Problem -- The Min-Max Edge q-Coloring Problem -- Speeding up Graph Algorithms via Switching Classes -- Metric Dimension for Amalgamations of Graphs -- Deterministic Algorithms for the Independent Feedback Vertex Set Problem -- Lossless seeds for searching short patterns with high error rates. |
| Record Nr. | UNISA-996198526003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Algorithms : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers / / edited by Kratochvíl Jan, Mirka Miller, Dalibor Froncek
| Combinatorial Algorithms : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers / / edited by Kratochvíl Jan, Mirka Miller, Dalibor Froncek |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XIII, 377 p. 70 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Machine theory Artificial intelligence—Data processing Bioinformatics Discrete Mathematics in Computer Science Discrete Mathematics Formal Languages and Automata Theory Data Science Computational and Systems Biology |
| ISBN | 3-319-19315-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism -- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem -- Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk -- On the Galois Lattice of Bipartite Distance Hereditary Graphs -- Fast Simple Computations Using Prefix Tables under Hamming and Edit Distance -- Border Correlations, Lattices and the Subgraph Component Polynomial -- Computing Minimum Length Representations of Sets of Words of Uniform Length -- Computing Primitively-Rooted Squares and Runs in Partial Words -- 3-coloring triangle-free planar graphs with a precolored 9-cycle -- Computing Heat Kernel Pagerank and a Local Clustering Algorithm -- Solving Matching Problems Efficiently in Bipartite Graphs -- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras -- On decomposing the complete graph into the union of two disjoint cycles -- Reconfiguration of Vertex Covers in a Graph -- Space Efficient Data Structures for Nearest Larger Neighbor Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory -- On Maximum Common Subgraph Problems in Series-Parallel Graphs -- Profile-based optimal matchings in the Student/Project Allocation Problem -- The Min-Max Edge q-Coloring Problem -- Speeding up Graph Algorithms via Switching Classes -- Metric Dimension for Amalgamations of Graphs -- Deterministic Algorithms for the Independent Feedback Vertex Set Problem -- Lossless seeds for searching short patterns with high error rates. |
| Record Nr. | UNINA-9910483048203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28--July 2, 2009, Revised Selected Papers / / edited by Jiri Fiala, Jan Kratochvil, Mirka Miller
| Combinatorial Algorithms [[electronic resource] ] : 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28--July 2, 2009, Revised Selected Papers / / edited by Jiri Fiala, Jan Kratochvil, Mirka Miller |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XII, 480 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Machine theory Coding theory Information theory Discrete Mathematics in Computer Science Discrete Mathematics Formal Languages and Automata Theory Coding and Information Theory Symbolic and Algebraic Manipulation |
| ISBN | 3-642-10217-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Branching Systems -- Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology -- Succinct Representations of Trees -- Kt Minors in Large t-Connected Graphs -- Intractability in Graph Drawing and Geometry: FPT Approaches -- Contributed Talks -- Evaluation of Recoverable-Robust Timetables on Tree Networks -- Weighted LCS -- Integrality Properties of Certain Special Balanceable Families -- Forbidden Subgraph Colorings and the Oriented Chromatic Number -- Polynomial Kernels for 3-Leaf Power Graph Modification Problems -- Approximating the Max Edge-Coloring Problem -- Three Complexity Results on Coloring P k -Free Graphs -- Fully Decomposable Split Graphs -- Feedback Vertex Set on Graphs of Low Cliquewidth -- Note on Decomposition of K n,n into (0,j)-prisms -- Edge-Simple Circuits through 10 Ordered Vertices in Square Grids -- Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search -- LPF Computation Revisited -- Limiting Distribution for Distances in k-Trees -- Gray Code Compression -- Embedded Trees and the Support of the ISE -- Combinatorial Models for Cooperation Networks -- Polar Permutation Graphs -- A New Algorithm for Efficient Pattern Matching with Swaps -- The Height and Range of Watermelons without Wall -- Fast Convolutions and Their Applications in Approximate String Matching -- Better Polynomial Algorithms on Graphs of Bounded Rank-Width -- Minimax Trees in Linear Time with Applications -- Planar Biconnectivity Augmentation with Fixed Embedding -- Trivially-Perfect Width -- Lightweight Parameterized Suffix Array Construction -- On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices -- Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees -- On the Maximal Number of Cubic Subwords in a String -- Solution of Peter Winkler’s Pizza Problem -- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs -- Simpler Parameterized Algorithm for OCT -- Bipartite Graphs of Large Clique-Width -- Kernel in Oriented Circulant Graphs -- Randomized Postoptimization of Covering Arrays -- New Word-Based Adaptive Dense Compressors -- Rainbow Connection in Graphs with Minimum Degree Three -- The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree -- Computability of Width of Submodular Partition Functions -- The Guarding Problem – Complexity and Approximation -- Antibandwidth of d-Dimensional Meshes. |
| Record Nr. | UNISA-996466361303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Magic and Antimagic Graphs : Attributes, Observations and Challenges in Graph Labelings / / by Martin Bača, Mirka Miller, Joe Ryan, Andrea Semaničová-Feňovčíková
| Magic and Antimagic Graphs : Attributes, Observations and Challenges in Graph Labelings / / by Martin Bača, Mirka Miller, Joe Ryan, Andrea Semaničová-Feňovčíková |
| Autore | Bača Martin |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XV, 322 p. 165 illus.) |
| Disciplina | 511.5 |
| Collana | Developments in Mathematics |
| Soggetto topico |
Graph theory
Combinatorics Computer science—Mathematics Graph Theory Discrete Mathematics in Computer Science |
| ISBN | 3-030-24582-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- 1 Introduction -- 2 Magic and supermagic graphs -- 3 Vertex-magic total labelings -- 4 Edge-magic total labelings -- 5 Vertex-antimagic total labelings -- 6 Edge-antimagic total labelings -- 7 Graceful and antimagic labelings -- 8 Conclusion -- Glossary of abbreviations used in the text -- Bibliography -- Index. |
| Record Nr. | UNINA-9910392719803321 |
|
Bača Martin
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||