標題: Titlebook: Computer Science – Theory and Applications; 13th International C Fedor V. Fomin,Vladimir V. Podolskii Conference proceedings 2018 Springer [打印本頁] 作者: raff淫雨霏霏 時間: 2025-3-21 19:06
書目名稱Computer Science – Theory and Applications影響因子(影響力)
書目名稱Computer Science – Theory and Applications影響因子(影響力)學科排名
書目名稱Computer Science – Theory and Applications網(wǎng)絡公開度
書目名稱Computer Science – Theory and Applications網(wǎng)絡公開度學科排名
書目名稱Computer Science – Theory and Applications被引頻次
書目名稱Computer Science – Theory and Applications被引頻次學科排名
書目名稱Computer Science – Theory and Applications年度引用
書目名稱Computer Science – Theory and Applications年度引用學科排名
書目名稱Computer Science – Theory and Applications讀者反饋
書目名稱Computer Science – Theory and Applications讀者反饋學科排名
作者: carbohydrate 時間: 2025-3-21 21:06
Implementation: Playing on Trust,elf, on complexity of generation algorithms. These algorithms can be partitioned into three groups: supergraph, flash-light (backtrack), and dual-bounded generation. We will call a problem . if it can be solved by a polynomial (.) or quasi-polynomial (.) time algorithm. More generally, for any posit作者: 全神貫注于 時間: 2025-3-22 00:42
Implementation: Playing on Trust,ose to achieving this goal: we do not know how to prove a?4. lower bound. What is more depressing is that there are almost no techniques for proving circuit lower bounds..In this note, we briefly review various approaches that could potentially lead to stronger linear or superlinear lower bounds for作者: Choreography 時間: 2025-3-22 04:43
The Chemistry of Frozen Vegetablesa structures. A stream of distinct integer items is to be assigned labels online from a label set . so that the order of the labels respects the natural order of the items. Maintaining order on the labels may require relabeling items. The algorithm pays 1 each time an item is labeled or relabeled an作者: LAVA 時間: 2025-3-22 11:33
https://doi.org/10.1007/978-1-4613-4595-4rtices and . edges and let (.,?.) be the edge to be deleted or inserted..Regarding lower bounds, we show that any dynamic structure to maintain a chordal graph requires . amortized time per edge addition or deletion or per query to detect chordality, in the cell probe model with word size ..作者: 銼屑 時間: 2025-3-22 15:54
https://doi.org/10.1007/978-1-4613-4595-4network by an .-vertex graph in which any pair of vertices can communicate one with another by transmitting . bits in each round. Various problems have been studied in this setting, but for some of them the best-known results are those for general networks. For other problems, the results for Conges作者: 銼屑 時間: 2025-3-22 20:05 作者: Vulnerary 時間: 2025-3-22 23:05
https://doi.org/10.1007/978-1-4684-8947-7 can orient the undirected edges in a way such that there is a directed . path for each terminal pair .. Arkin and Hassin [DAM’02] showed that the . problem is NP-complete. They also gave a polynomial time algorithm for the special case when ...From the viewpoint of exact algorithms, Cygan, Kortsarz作者: NATAL 時間: 2025-3-23 04:43
J. Mayo Greenberg,Celia X. Mendoza-Gómezcted graph is the maximal induced subgraph such that each vertex in it has degree at least?.. Hence, finding a .-core helps to identify a (core) community where each entity is related to at least . other entities. One can find the .-core of a given graph in polynomial time, by iteratively deleting e作者: Bother 時間: 2025-3-23 07:57 作者: Diskectomy 時間: 2025-3-23 10:11 作者: 連鎖 時間: 2025-3-23 13:58 作者: 全能 時間: 2025-3-23 19:12 作者: 錢財 時間: 2025-3-23 22:13
Occurrence, Formation, and Importance,tomaton’s computation over a specific set of words. The periodicity is partly due to the finiteness of the automaton description and partly due to the word’s structure. Using such a periodicity we can find a word such that during the automaton’s run on it there are two different, yet indistinguishab作者: HERTZ 時間: 2025-3-24 05:54
https://doi.org/10.1007/978-94-007-7578-7 fixed-parameter tractable (FPT) algorithms and lower bounds under well-known conjectures for dominating set in graphs that are . vertices away from a cluster graph or a split graph. These are graphs in which there is a set of . vertices (called the modulator) whose deletion results in a cluster gra作者: 搜集 時間: 2025-3-24 07:11
https://doi.org/10.1007/978-94-007-7578-7ble in pseudo-polynomial time for each .. We give a positive answer to the long-standing open question whether this problem is strongly .-complete for .. As a second result, we improve the lower bound of . for approximating pseudo-polynomial Strip Packing to .. Since the best known approximation alg作者: motivate 時間: 2025-3-24 14:05
The Coordination Chemistry of Mercury,ular, we consider the operations of difference, symmetric difference, star, reversal, left quotient, and right quotient, and get tight upper bounds . and ., respectively, for Boolean automata, and ., and ., respectively, for alternating finite automata. To describe witnesses for symmetric difference作者: 通知 時間: 2025-3-24 18:36 作者: 不愛防注射 時間: 2025-3-24 21:21 作者: Legion 時間: 2025-3-25 02:04 作者: 文字 時間: 2025-3-25 03:36
Computer Science – Theory and Applications978-3-319-90530-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: adulterant 時間: 2025-3-25 08:18 作者: infelicitous 時間: 2025-3-25 14:30
https://doi.org/10.1007/978-3-319-90530-3approximation algorithms; artificial intelligence; automata theory; bits; case based reasoning (cbr); dat作者: Exonerate 時間: 2025-3-25 15:59 作者: nutrition 時間: 2025-3-25 23:31 作者: dysphagia 時間: 2025-3-26 00:27 作者: insurrection 時間: 2025-3-26 05:49
The Chemistry of Imidoyl Halides all prices are equal. We complement each result with hardness proofs in order to draw a tight boundary between tractable and intractable cases. Finally, we give an approximation algorithm and hardness results for the problem of maximising the sum of discounts.作者: Gleason-score 時間: 2025-3-26 09:05
The Chemistry of Life’s Originsd. Finally, we show that equality of unranked trees in the setting where certain symbols are associative or commutative can be tested in polynomial time. This generalizes previous results for testing isomorphism of compressed unordered ranked trees.作者: DRAFT 時間: 2025-3-26 16:14 作者: 山間窄路 時間: 2025-3-26 16:59 作者: 通情達理 時間: 2025-3-26 21:54
0302-9743 May 2018..The 24 full papers presented together with 7 invited lectures were carefully reviewed and selected from 42 submissions.? The papers cover a wide range of topics such as algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; c作者: APRON 時間: 2025-3-27 02:41 作者: osteopath 時間: 2025-3-27 05:23 作者: Gobble 時間: 2025-3-27 13:24
Chirality and the Origins of Life,that the problem is NP-hard even for simple graphs such as split graphs, biconnected graphs, interval graphs. Then we provide polynomial-time algorithms for classes of vertex-colored threshold graphs and vertex-colored bipartite chain graphs, which are our main contributions.作者: Morsel 時間: 2025-3-27 16:42
Occurrence, Formation, and Importance,owever, since .s do not have resources to detect infinite loops by counting executed steps, the best construction known so far required . states. Here we shall show that the cost of complementing is polynomial in?.. This complementary simulation does not eliminate infinite loops.作者: 法律 時間: 2025-3-27 21:45
Occurrence, Formation, and Importance, word’s structure. Using such a periodicity we can find a word such that during the automaton’s run on it there are two different, yet indistinguishable, configurations. This enables us to remove a part of that word without affecting acceptance. Choosing an appropriate language leads us to the desired result.作者: 群島 時間: 2025-3-28 00:53 作者: PATHY 時間: 2025-3-28 04:31 作者: 蚊帳 時間: 2025-3-28 07:27
Online Labeling: Algorithms, Lower Bounds and Open Questions,al order of the items. Maintaining order on the labels may require relabeling items. The algorithm pays 1 each time an item is labeled or relabeled and the goal of the algorithm is to minimize the total cost..We survey upper and lower bounds and open problems in both the deterministic and randomized setting.作者: UTTER 時間: 2025-3-28 12:51 作者: Flavouring 時間: 2025-3-28 15:48 作者: CIS 時間: 2025-3-28 19:25 作者: Missile 時間: 2025-3-29 00:55 作者: 召集 時間: 2025-3-29 06:01
Early Evolution of the Atmosphere and Ocean, space in one pass. We then give a one-pass randomized streaming algorithm that computes all wildcard-periods . of . with . and no wildcard characters appearing in the last . symbols of ., using . space.作者: Omniscient 時間: 2025-3-29 11:03
https://doi.org/10.1007/978-94-007-7578-7arameterized by the deletion distance . to cluster graphs,.The standard dominating set and most of its variants are .-hard or .[2]-hard in split graphs. For the two variants IDS and EDS that are polynomial time solvable in split graphs, we show that when parameterized by the deletion distance . to split graphs,作者: BAIT 時間: 2025-3-29 11:59
Periodicity in Data Streams with Wildcards, space in one pass. We then give a one-pass randomized streaming algorithm that computes all wildcard-periods . of . with . and no wildcard characters appearing in the last . symbols of ., using . space.作者: adj憂郁的 時間: 2025-3-29 17:23
,Structural Parameterizations of?Dominating Set Variants,arameterized by the deletion distance . to cluster graphs,.The standard dominating set and most of its variants are .-hard or .[2]-hard in split graphs. For the two variants IDS and EDS that are polynomial time solvable in split graphs, we show that when parameterized by the deletion distance . to split graphs,作者: 協(xié)奏曲 時間: 2025-3-29 20:50
The Clever Shopper Problem, all prices are equal. We complement each result with hardness proofs in order to draw a tight boundary between tractable and intractable cases. Finally, we give an approximation algorithm and hardness results for the problem of maximising the sum of discounts.作者: debouch 時間: 2025-3-30 01:37
Grammar-Based Compression of Unranked Trees,d. Finally, we show that equality of unranked trees in the setting where certain symbols are associative or commutative can be tested in polynomial time. This generalizes previous results for testing isomorphism of compressed unordered ranked trees.作者: dyspareunia 時間: 2025-3-30 07:15
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing,orithm for this problem has a ratio of ., this result narrows the gap between approximation ratio and inapproximability result by a significant step. Both results are proven by a reduction from the strongly .-complete problem 3-Partition.作者: MOAT 時間: 2025-3-30 08:54
On Vertex Coloring Without Monochromatic Triangles,cted, simple graphs – the triangle-free chromatic number .. We bound . by other known structural parameters. We also present two classes of graphs with interesting coloring properties, that play pivotal role in proving useful observations about our problem.作者: 認識 時間: 2025-3-30 12:58 作者: endocardium 時間: 2025-3-30 17:57
Conference proceedings 2018The 24 full papers presented together with 7 invited lectures were carefully reviewed and selected from 42 submissions.? The papers cover a wide range of topics such as algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatori作者: GEST 時間: 2025-3-30 21:49 作者: CODE 時間: 2025-3-31 03:07 作者: LEER 時間: 2025-3-31 07:28 作者: 難管 時間: 2025-3-31 11:52
J. Mayo Greenberg,Celia X. Mendoza-Gómezng dichotomy: EKC is polytime solvable for . and NP-hard for .. Then, we show that EKC is W[1]-hard even when parameterized by .. In searching for an FPT algorithm, we consider the parameter “treewidth”, and design an FPT algorithm for EKC which runs in time ., where . is the treewidth of the input 作者: 天真 時間: 2025-3-31 13:35
The Biochemistry and Toxicology of Mercury,e (.). Furthermore, we obtain improved algorithms for conflict free version of several well studied problems. Next, we show that if . is characterized by a “well-behaved” infinite family of forbidden induced subgraphs, then .-.-. is .-hard. Motivated by this hardness result, we consider the paramete作者: 人造 時間: 2025-3-31 19:03 作者: esthetician 時間: 2025-3-31 21:55 作者: 浮夸 時間: 2025-4-1 02:19 作者: 國家明智 時間: 2025-4-1 07:16
A Tight Lower Bound for Steiner Orientation,st optimal..In this paper, we give a short and easy proof that the . algorithm of Cygan et al. is asymptotically optimal, even if the input graph has genus 1. Formally, we show that the . problem is W[1]-hard parameterized by the number . of terminal pairs, and, under ETH, cannot be solved in . time作者: flammable 時間: 2025-4-1 12:24 作者: optic-nerve 時間: 2025-4-1 18:05
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized,e (.). Furthermore, we obtain improved algorithms for conflict free version of several well studied problems. Next, we show that if . is characterized by a “well-behaved” infinite family of forbidden induced subgraphs, then .-.-. is .-hard. Motivated by this hardness result, we consider the paramete
