Combinatorial Algorithms
Editat de Kratochvíl Jan, Mirka Miller, Dalibor Fronceken Limba Engleză Paperback – 25 iun 2015
Preț: 325.88 lei
Preț vechi: 407.36 lei
-20% Nou
Puncte Express: 489
Preț estimativ în valută:
57.66€ • 67.27$ • 50.41£
57.66€ • 67.27$ • 50.41£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319193144
ISBN-10: 3319193147
Pagini: 392
Ilustrații: XIII, 377 p. 70 illus.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:2015
Editura: Springer
Locul publicării:Cham, Switzerland
ISBN-10: 3319193147
Pagini: 392
Ilustrații: XIII, 377 p. 70 illus.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:2015
Editura: Springer
Locul publicării:Cham, Switzerland
Public țintă
ResearchCuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras