東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ subject:"Arithmetic and Logic Structures." ]

切換: 標籤 | MARC模式 | ISBD

Algorithms and complexity = 11th Int...

International Conference on Algorithms and Complexity (2019 :)

FindBook

Google Book

Amazon

博客來

Algorithms and complexity = 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithms and complexity/ edited by Pinar Heggernes.
其他題名:	11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019 : proceedings /
其他題名:	CIAC 2019
其他作者:	Heggernes, Pinar.
團體作者:	International Conference on Algorithms and Complexity
出版者:	Cham :Springer International Publishing : : 2019.,
面頁冊數:	xiii, 378 p. :ill., digital ;24 cm.
內容註:	Quadratic Vertex Kernel for Split Vertex Deletion -- The temporal explorer who returns to the base -- Minimum Convex Partition of Point Sets -- Parameterized Complexity of Safe Set -- Parameterized Complexity of Diameter -- Fixed-parameter algorithms for maximum-profit facility location under matroid constraints -- Project Games -- Subgraph Isomorphism on Graph Classes that Exclude a Substructure -- Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors -- k-cuts on a path -- Extension of vertex cover and independent set in some classes of graphs -- On Hedonic Games with Common Ranking Property -- Complexity of scheduling for DARP with soft ride times -- Vertex Deletion on Split Graphs: Beyond 4-Hitting Set -- Fair Hitting Sequence problem: scheduling activities with varied frequency requirements -- Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability -- Searching by heterogeneous agents -- Finding a Mediocre Player -- Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation -- The Parameterized Position Heap of a Trie -- Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set -- Shortest Reconfiguration Sequence for Sliding Tokens on Spiders -- Turing Tumble is P(SPACE)-Complete -- Linear-Time In-Place DFS and BFS on the Word RAM -- A Faster Algorithm for the Strongly Stable b-Matching Problem -- Eternal Domination in Grids -- On the Necessary Memory to Compute the Plurality in Multi-Agent Systems -- Complexity of Vertex Switching on Edge-Bicolored Graphs -- Independent lazy better-response dynamics on network games -- Subset Feedback Vertex Set in Chordal and Split Graphs.
Contained By:	Springer Nature eBook
標題:	Algorithms - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-030-17402-6
ISBN:	9783030174026

Algorithms and complexity = 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019 : proceedings /
Algorithms and complexity11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019 : proceedings /[electronic resource] :CIAC 2019edited by Pinar Heggernes. - Cham :Springer International Publishing :2019. - xiii, 378 p. :ill., digital ;24 cm. - Lecture notes in computer science,114850302-9743 ;. - Lecture notes in computer science ;11485..

Quadratic Vertex Kernel for Split Vertex Deletion -- The temporal explorer who returns to the base -- Minimum Convex Partition of Point Sets -- Parameterized Complexity of Safe Set -- Parameterized Complexity of Diameter -- Fixed-parameter algorithms for maximum-profit facility location under matroid constraints -- Project Games -- Subgraph Isomorphism on Graph Classes that Exclude a Substructure -- Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors -- k-cuts on a path -- Extension of vertex cover and independent set in some classes of graphs -- On Hedonic Games with Common Ranking Property -- Complexity of scheduling for DARP with soft ride times -- Vertex Deletion on Split Graphs: Beyond 4-Hitting Set -- Fair Hitting Sequence problem: scheduling activities with varied frequency requirements -- Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability -- Searching by heterogeneous agents -- Finding a Mediocre Player -- Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation -- The Parameterized Position Heap of a Trie -- Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set -- Shortest Reconfiguration Sequence for Sliding Tokens on Spiders -- Turing Tumble is P(SPACE)-Complete -- Linear-Time In-Place DFS and BFS on the Word RAM -- A Faster Algorithm for the Strongly Stable b-Matching Problem -- Eternal Domination in Grids -- On the Necessary Memory to Compute the Plurality in Multi-Agent Systems -- Complexity of Vertex Switching on Edge-Bicolored Graphs -- Independent lazy better-response dynamics on network games -- Subset Feedback Vertex Set in Chordal and Split Graphs.

This book constitutes the refereed conference proceedings of the 11th International Conference on Algorithms and Complexity, CIAC 2019, held in Rome, Italy, in May 2019. The 30 full papers were carefully reviewed and selected from 95 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity.

ISBN: 9783030174026

Standard No.: 10.1007/978-3-030-17402-6doiSubjects--Topical Terms:

607038
Algorithms
--Congresses.

LC Class. No.: QA76.9.A43 / I57 2019

Dewey Class. No.: 518.1

Algorithms and complexity = 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019 : proceedings /
LDR:03508nmm a2200361 a 4500 001 2242764
003 DE-He213
005 20200703134805.0
006 m d
007 cr nn 008maaau
008 211207s2019 sz s 0 eng d
020 $a 9783030174026 $q (electronic bk.)
020 $a 9783030174019 $q (paper)
024 7 $a 10.1007/978-3-030-17402-6 $2 doi
035 $a 978-3-030-17402-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b I57 2019
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 518.1 $2 23
090 $a QA76.9.A43 $b I61 2019
111 2 $a International Conference on Algorithms and Complexity $n (11th : $d 2019 : $c Rome, Italy) $3 3502249
245 1 0 $a Algorithms and complexity $h [electronic resource] : $b 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019 : proceedings / $c edited by Pinar Heggernes.
246 3 $a CIAC 2019
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xiii, 378 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11485
490 1 $a Theoretical computer science and general issues
505 0 $a Quadratic Vertex Kernel for Split Vertex Deletion -- The temporal explorer who returns to the base -- Minimum Convex Partition of Point Sets -- Parameterized Complexity of Safe Set -- Parameterized Complexity of Diameter -- Fixed-parameter algorithms for maximum-profit facility location under matroid constraints -- Project Games -- Subgraph Isomorphism on Graph Classes that Exclude a Substructure -- Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors -- k-cuts on a path -- Extension of vertex cover and independent set in some classes of graphs -- On Hedonic Games with Common Ranking Property -- Complexity of scheduling for DARP with soft ride times -- Vertex Deletion on Split Graphs: Beyond 4-Hitting Set -- Fair Hitting Sequence problem: scheduling activities with varied frequency requirements -- Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability -- Searching by heterogeneous agents -- Finding a Mediocre Player -- Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation -- The Parameterized Position Heap of a Trie -- Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set -- Shortest Reconfiguration Sequence for Sliding Tokens on Spiders -- Turing Tumble is P(SPACE)-Complete -- Linear-Time In-Place DFS and BFS on the Word RAM -- A Faster Algorithm for the Strongly Stable b-Matching Problem -- Eternal Domination in Grids -- On the Necessary Memory to Compute the Plurality in Multi-Agent Systems -- Complexity of Vertex Switching on Edge-Bicolored Graphs -- Independent lazy better-response dynamics on network games -- Subset Feedback Vertex Set in Chordal and Split Graphs.
520 $a This book constitutes the refereed conference proceedings of the 11th International Conference on Algorithms and Complexity, CIAC 2019, held in Rome, Italy, in May 2019. The 30 full papers were carefully reviewed and selected from 95 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity.
650 0 $a Algorithms $v Congresses. $3 607038
650 0 $a Computational complexity $v Congresses. $3 628000
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Data Structures. $3 891009
650 2 4 $a Arithmetic and Logic Structures. $3 893182
700 1 $a Heggernes, Pinar. $3 2114932
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 11485. $3 3502250
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-030-17402-6
950 $a Computer Science (SpringerNature-11645)