>> Google Books

Combinatorial Algorithms : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers

フォーマット:
電子ブック
責任表示:
edited by Kratochvil Jan, Mirka Miller, Dalibor Froncek
言語:
英語
出版情報:
Cham : Springer International Publishing : Imprint: Springer, 2015
形態:
XIII, 377 p. 70 illus
著者名:
シリーズ名:
Lecture Notes in Computer Science ; 8986
目次情報:
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
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
続きを見る
書誌ID:
LB00386270
ISBN:
9783319193144 [3319193147]  CiNii Books  Webcat Plus  Google Books
9783319193151 [3319193155]  CiNii Books  Webcat Plus  Google Books
子書誌情報
Loading
オンライン
所蔵情報
Loading availability information

類似資料:

1
 
2
 
3
 
4
 
5
 
6
 
7
 
8
 
9
 
10
 
11
 
12
 

Sanita, Laura, Skutella, Martin, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Drewes, Frank, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Pop, Mihai, Touzet, Helene, SpringerLink (Online service)

Springer Berlin Heidelberg : Imprint: Springer

Botana, Francisco, Quaresma, Pedro, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Phillips, Andrew, Yin, Peng, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Falaschi, Moreno, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Bampis, Evripidis, Svensson, Ola, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Isokawa, Teijiro, Imai, Katsunobu, Matsui, Nobuyuki, Peper, Ferdinand, Umeo, Hiroshi, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Cicalese, Ferdinando, Porat, Ely, Vaccaro, Ugo, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Parisi-Presicce, Francesco, Westfechtel, Bernhard, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Shallit, Jeffrey, Okhotin, Alexander, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Italiano, Giuseppe F., Pighizzini, Giovanni, Sannella, Donald T., SpringerLink (Online service)

Springer Berlin Heidelberg : Imprint: Springer