書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science年度引用
書目名稱Graph-Theoretic Concepts in Computer Science年度引用學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學(xué)科排名
作者: 下船 時間: 2025-3-21 22:52
https://doi.org/10.1007/978-3-663-10829-0 This data structure supports farthest-point queries in . time after . construction time, where?. is the number of farthest points, . is the size of the network, and?. parallel operations are required to generate the network.作者: 粗語 時間: 2025-3-22 02:05 作者: nocturia 時間: 2025-3-22 06:17 作者: dilute 時間: 2025-3-22 12:06 作者: maintenance 時間: 2025-3-22 13:30 作者: maintenance 時間: 2025-3-22 17:51 作者: lipoatrophy 時間: 2025-3-22 21:55
On the Complexity of Computing the ,-restricted Edge-connectivity of a Graphhis invariant from both combinatorial and algorithmic points of view, in this article we initiate a systematic study of its computational complexity, with special emphasis on its parameterized complexity for several choices of the parameters. We provide a number of .-hardness and .[1]-hardness results, as well as .-algorithms.作者: inchoate 時間: 2025-3-23 02:09 作者: intellect 時間: 2025-3-23 06:48
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphslynomial delay algorithm to list the set of minimal dominating sets in chordal graphs, an important and well-studied graph class where such an algorithm was not known. The algorithm uses a new decomposition method of chordal graphs based on clique trees.作者: 黃油沒有 時間: 2025-3-23 10:44
https://doi.org/10.1007/978-3-642-55076-8o?. such that the resulting graph fulfills a certain property. For example, the . problem asks to delete as few edges as possible such that the resulting graph is a disjoint union of cliques. Graph modification problems appear in numerous applications, including the analysis of biological and social作者: PLE 時間: 2025-3-23 16:30
https://doi.org/10.1007/978-3-658-04680-4that . for every edge?.. We survey known results on the computational complexity of . for graph classes that are hereditary or for which some graph parameter is bounded. We also consider coloring variants, such as precoloring extensions and list colorings and give some open problems in the area of o作者: HARD 時間: 2025-3-23 20:55
https://doi.org/10.1007/978-3-322-87480-1r several optimization problems. They include offline and online scenarios, and concern problems that optimize the use of components in the optical networks, specifically Add-Drop Multiplexers (ADMs) and regenerators.作者: aesthetician 時間: 2025-3-24 01:36 作者: Mystic 時間: 2025-3-24 03:33
https://doi.org/10.1007/978-3-642-79368-4own that deciding whether a set . is secure in a graph is .-complete. However, it is still open how this result contributes to the actual complexity of deciding whether, for a given graph . and integer ., a non-empty secure set for . of size at most . exists. While membership in the class . is rathe作者: 欲望小妹 時間: 2025-3-24 06:30 作者: Serenity 時間: 2025-3-24 10:54 作者: Prognosis 時間: 2025-3-24 18:11 作者: extrovert 時間: 2025-3-24 20:43 作者: 無目標(biāo) 時間: 2025-3-24 23:36 作者: Organonitrile 時間: 2025-3-25 06:49 作者: 預(yù)感 時間: 2025-3-25 07:39
Moderne Mehrgitter-Elektronenr?hrent is NP-hard in general graphs, we demonstrate that a minimum eccentricity shortest path can be found in linear time for distance-hereditary graphs (generalizing the previous result for trees) and in . time for chordal graphs.作者: lambaste 時間: 2025-3-25 12:13 作者: Ischemic-Stroke 時間: 2025-3-25 15:53
https://doi.org/10.1007/978-3-642-50742-7 at least . vertices. This graph invariant, which can be seen as a generalization of a minimum edge-cut, has been extensively studied from a combinatorial point of view. However, very little is known about the complexity of computing .. Very recently, in the parameterized complexity community the no作者: 相信 時間: 2025-3-25 22:19 作者: Palliation 時間: 2025-3-26 01:46 作者: 歡呼 時間: 2025-3-26 04:44 作者: COWER 時間: 2025-3-26 11:37
The Stable Fixtures Problem with Paymentsity function?. and an edge weighting .. The set . consists of a number of players that are to form a set . of 2-player coalitions . with value .(.), such that each player . is in at most .(.) coalitions. A payoff is a mapping . with . if . and . if .. The pair (.,?.) is called a solution. A pair of 作者: insular 時間: 2025-3-26 14:42
Complexity of Secure Setsown that deciding whether a set . is secure in a graph is .-complete. However, it is still open how this result contributes to the actual complexity of deciding whether, for a given graph . and integer ., a non-empty secure set for . of size at most . exists. While membership in the class . is rathe作者: sed-rate 時間: 2025-3-26 17:56 作者: Foolproof 時間: 2025-3-26 22:08 作者: CHAFE 時間: 2025-3-27 02:49 作者: 稱贊 時間: 2025-3-27 06:39 作者: 同來核對 時間: 2025-3-27 13:25 作者: 透明 時間: 2025-3-27 14:12
The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Resultsn infected forever and in consecutive rounds healthy vertices with at least two already infected neighbors become infected. Percolation occurs if eventually every vertex is infected. The maximum time .(.) is the maximum number of rounds needed to eventually infect the entire vertex set. In 2013, it 作者: 小溪 時間: 2025-3-27 19:00
Minimum Eccentricity Shortest Paths in Some Structured Graph Classest is NP-hard in general graphs, we demonstrate that a minimum eccentricity shortest path can be found in linear time for distance-hereditary graphs (generalizing the previous result for trees) and in . time for chordal graphs.作者: 短程旅游 時間: 2025-3-27 22:18
Approximating Source Location and Star Survivable Network Problems . of .. In many . problems . if ., so the demand of nodes selected to . is completely satisfied. In a variant suggested recently by Fukunaga [.], every node . selected to . gets a “bonus” ., and . if . and . otherwise, where . is the maximum number of internally disjoint (.,?.)-paths. While the app作者: IRS 時間: 2025-3-28 02:07 作者: uncertain 時間: 2025-3-28 07:20
https://doi.org/10.1007/978-3-658-04680-4that . for every edge?.. We survey known results on the computational complexity of . for graph classes that are hereditary or for which some graph parameter is bounded. We also consider coloring variants, such as precoloring extensions and list colorings and give some open problems in the area of on-line coloring.作者: SPER 時間: 2025-3-28 12:37
https://doi.org/10.1007/978-3-322-87480-1r several optimization problems. They include offline and online scenarios, and concern problems that optimize the use of components in the optical networks, specifically Add-Drop Multiplexers (ADMs) and regenerators.作者: ingenue 時間: 2025-3-28 17:17 作者: OMIT 時間: 2025-3-28 19:11 作者: 調(diào)色板 時間: 2025-3-28 23:57
On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networ several optimization problems. They include offline and online scenarios, and concern problems that optimize the use of components in the optical networks, specifically Add-Drop Multiplexers (ADMs) and regenerators.作者: HAUNT 時間: 2025-3-29 05:38
Minimum Eccentricity Shortest Paths in Some Structured Graph Classest is NP-hard in general graphs, we demonstrate that a minimum eccentricity shortest path can be found in linear time for distance-hereditary graphs (generalizing the previous result for trees) and in . time for chordal graphs.作者: 肥料 時間: 2025-3-29 10:01 作者: 雇傭兵 時間: 2025-3-29 11:37 作者: Incumbent 時間: 2025-3-29 18:23 作者: 條約 時間: 2025-3-29 21:24 作者: ASTER 時間: 2025-3-30 03:33
On the Number of Minimal Separators in GraphsWe consider the largest number of minimal separators a graph on . vertices can have..This gives also an improved lower bound on the number of potential maximal cliques in a graph. We would like to emphasize that our proofs are short, simple, and elementary.作者: Acquired 時間: 2025-3-30 07:24 作者: 到婚嫁年齡 時間: 2025-3-30 10:04 作者: 瑣事 時間: 2025-3-30 13:21 作者: MURKY 時間: 2025-3-30 16:56 作者: GLOSS 時間: 2025-3-30 22:56
Moderne Marketing-Kommunikationime solvable for solid grid graphs with maximum degree 3. Moreover, we prove that the percolation time problem is fixed parameter tractable with respect to the parameter treewidth. and maximum degree.. Finally, we obtain polynomial time algorithms for several graphs with few .’s, as cographs and .-s作者: PLE 時間: 2025-3-31 01:31 作者: entail 時間: 2025-3-31 07:15
The Stable Fixtures Problem with Payments which correspond to the case where . is bipartite (Sotomayor 1992) and for the case where . (Biro et al. 2012). We also characterize the set of stable solutions of a multiple partners matching game in two different ways and initiate a study on the core of the corresponding cooperative game, where c作者: AVOW 時間: 2025-3-31 10:42
Efficient Domination for Some Subclasses of ,-free Graphs in Polynomial Timerdal graphs. Moreover, based on our result that squares of .-free graphs that have an e.d. are hole-free and some properties concerning odd antiholes, we show that squares of (., house)-free graphs ((., bull)-free graphs, respectively) that have an e.d. are perfect. This implies that ED/WeightedED i作者: Boycott 時間: 2025-3-31 13:56 作者: 裁決 時間: 2025-3-31 17:47 作者: 極少 時間: 2025-3-31 21:50 作者: deciduous 時間: 2025-4-1 01:58 作者: Synchronism 時間: 2025-4-1 07:17
Systematic Fidelity Researchdevices could not be made until a body of empirical data on fidelity effects in training systems was generated. A series of experiments intended to begin the generation of such a body of data were sponsored by the Army Research Institute (ARI).作者: 細(xì)微差別 時間: 2025-4-1 12:44
