東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ subject:"Discrete Mathematics." ]

切換: 標籤 | MARC模式 | ISBD

Combinatorial algorithms = 25th Inte...

Jan, Kratochvil.

FindBook

Google Book

Amazon

博客來

Combinatorial algorithms = 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014 : revised selected papers /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Combinatorial algorithms/ edited by Kratochvil Jan, Mirka Miller, Dalibor Froncek.
其他題名:	25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014 : revised selected papers /
其他題名:	IWOCA 2014
其他作者:	Jan, Kratochvil.
出版者:	Cham :Springer International Publishing : : 2015.,
面頁冊數:	xiii, 377 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer eBooks
標題:	Combinatorial analysis -
電子資源:	http://dx.doi.org/10.1007/978-3-319-19315-1
ISBN:	9783319193151 (electronic bk.)

Combinatorial algorithms = 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014 : revised selected papers /
Combinatorial algorithms25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014 : revised selected papers /[electronic resource] :IWOCA 2014edited by Kratochvil Jan, Mirka Miller, Dalibor Froncek. - Cham :Springer International Publishing :2015. - xiii, 377 p. :ill., digital ;24 cm. - Lecture notes in computer science,89860302-9743 ;. - Lecture notes in computer science ;5353..

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.

This book constitutes the thoroughly refereed post-workshop proceedings of the 25th International Workshop on Combinatorial Algorithms, IWOCA 2014, held in Duluth, MN, USA, in October 2014. The 32 revised full papers presented were carefully reviewed and selected from a total of 69 submissions. The papers focus on topics such as Algorithms and Data Structures, Combinatorial Enumeration, Combinatorial Optimization, Complexity Theory (Structural and Computational), Computational Biology, Databases (Security, Compression and Information Retrieval), Decompositions and Combinatorial Designs, Discrete and Computational Geometry, as well as Graph Drawing and Graph Theory. IWOCA is a yearly forum for researchers in designing algorithms field to advance creativeness of intersection between mathematics and computer science. This is the first time this conference is being held in U.S.

ISBN: 9783319193151 (electronic bk.)

Standard No.: 10.1007/978-3-319-19315-1doiSubjects--Topical Terms:

1236043
Combinatorial analysis

LC Class. No.: QA164

Dewey Class. No.: 511.6

Combinatorial algorithms = 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014 : revised selected papers /
LDR:03695nam a2200361 a 4500 001 2007545
003 DE-He213
005 20160119095711.0
006 m d
007 cr nn 008maaau
008 160219s2015 gw s 0 eng d
020 $a 9783319193151 (electronic bk.)
020 $a 9783319193144 (paper)
024 7 $a 10.1007/978-3-319-19315-1 $2 doi
035 $a 978-3-319-19315-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA164
072 7 $a PBD $2 bicssc
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a MAT008000 $2 bisacsh
082 0 4 $a 511.6 $2 23
090 $a QA164 $b .I61 2014
245 1 0 $a Combinatorial algorithms $h [electronic resource] : $b 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014 : revised selected papers / $c edited by Kratochvil Jan, Mirka Miller, Dalibor Froncek.
246 3 $a IWOCA 2014
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a xiii, 377 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 8986
505 0 $a 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.
520 $a This book constitutes the thoroughly refereed post-workshop proceedings of the 25th International Workshop on Combinatorial Algorithms, IWOCA 2014, held in Duluth, MN, USA, in October 2014. The 32 revised full papers presented were carefully reviewed and selected from a total of 69 submissions. The papers focus on topics such as Algorithms and Data Structures, Combinatorial Enumeration, Combinatorial Optimization, Complexity Theory (Structural and Computational), Computational Biology, Databases (Security, Compression and Information Retrieval), Decompositions and Combinatorial Designs, Discrete and Computational Geometry, as well as Graph Drawing and Graph Theory. IWOCA is a yearly forum for researchers in designing algorithms field to advance creativeness of intersection between mathematics and computer science. This is the first time this conference is being held in U.S.
650 0 $a Combinatorial analysis $3 1236043
650 0 $a Algorithms $v Congresses. $3 1245444
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Discrete Mathematics. $3 1569938
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Mathematical Logic and Formal Languages. $3 892517
650 2 4 $a Data Structures. $3 891009
650 2 4 $a Computational Biology/Bioinformatics. $3 898313
700 1 $a Jan, Kratochvil. $3 2156406
700 1 $a Miller, Mirka. $3 2156407
700 1 $a Froncek, Dalibor. $3 2156408
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 5353. $x 0302-9743 $3 1274248
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-19315-1
950 $a Computer Science (Springer-11645)