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
館藏地:  出版年:  卷號: 
館藏
  • 1 筆 • 頁數 1 •
 
W9403810 電子資源 11.線上閱覽_V 電子書 EB QA76.9.A43 I57 2019 一般使用(Normal) 在架 0
  • 1 筆 • 頁數 1 •
多媒體
評論
Export
取書館
 
 
變更密碼
登入