書目名稱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é)科排名
作者: gusher 時(shí)間: 2025-3-21 22:49
Modified Posterior Approach to the Hip JointIn this paper we study a stochastic location problem with applications to tele-diagnostic, locating the boundaries between polynomiality and NP-completeness, and providing efficient approximation algorithms.作者: Airtight 時(shí)間: 2025-3-22 04:25 作者: biosphere 時(shí)間: 2025-3-22 08:22 作者: MAUVE 時(shí)間: 2025-3-22 10:02
Modes of Action of GnRH and GnRH Analogsgorithmic search paradigm, with applications in recognition of restricted graph families, diameter approximation for restricted families and determining a dominating pair in an AT-free graph. This paper surveys this area and provides new directions for further research in the area of graph searching.作者: 敲竹杠 時(shí)間: 2025-3-22 14:57
https://doi.org/10.1057/9781137403865 treelike comparability graphs are distance hereditary. Utilizing this property, we give a linear time recognition algorithm. We then characterize permutation graphs that are treelike. Finally, we consider the . problem on special subgraphs of treelike permutation graphs.作者: 敲竹杠 時(shí)間: 2025-3-22 20:37 作者: 圖表證明 時(shí)間: 2025-3-23 00:35 作者: 易受騙 時(shí)間: 2025-3-23 05:05
Modified Atmosphere Packaging of Foodasses of graphs. In particular we present an .(...) algorithm to compute the chromatic number for all those graphs having a split decomposition in which every prime graph is an induced subgraph of either a .. or a . for some .≥ 3.作者: maroon 時(shí)間: 2025-3-23 06:07
Lexicographic Breadth First Search – A Surveygorithmic search paradigm, with applications in recognition of restricted graph families, diameter approximation for restricted families and determining a dominating pair in an AT-free graph. This paper surveys this area and provides new directions for further research in the area of graph searching.作者: TSH582 時(shí)間: 2025-3-23 21:56
Bimodular Decomposition of Bipartite Graphs). It is shown how a unique decomposition tree represents the bimodular decomposition of a bipartite graph, with strong analogs with modular decomposition of graphs. An .(..) algorithm for this decomposition is provided. At least a classification of the 2-modules of a bipartite graph is given.作者: 津貼 時(shí)間: 2025-3-24 00:51
Coloring a Graph Using Split Decompositionasses of graphs. In particular we present an .(...) algorithm to compute the chromatic number for all those graphs having a split decomposition in which every prime graph is an induced subgraph of either a .. or a . for some .≥ 3.作者: sundowning 時(shí)間: 2025-3-24 04:04 作者: 提升 時(shí)間: 2025-3-24 08:15 作者: 慟哭 時(shí)間: 2025-3-24 13:22 作者: 防銹 時(shí)間: 2025-3-24 15:46 作者: cacophony 時(shí)間: 2025-3-24 22:37 作者: 半圓鑿 時(shí)間: 2025-3-25 00:15
https://doi.org/10.1007/978-94-010-3030-4s appearing in a neighborhood of a vertex can be completed into intervals such that these intervals are disjoint for adjacent vertices. We justify introduction of this notion by showing that use of these labelings provides good estimates for the span of the label space, and also provide a polynomial作者: 沒有準(zhǔn)備 時(shí)間: 2025-3-25 05:30
https://doi.org/10.1007/978-3-319-33282-6graph .=(.,.) ... if there is a system . of at most . spanning trees of . such that for any two vertices .,. of . a spanning tree . exists such that ..(.,.)≤ ..(.,.)+.. Among other results, we show that AT-free graphs have a system of two collective additive tree 2-spanners (whereas there are trapez作者: 想象 時(shí)間: 2025-3-25 10:02 作者: 仔細(xì)檢查 時(shí)間: 2025-3-25 13:43
https://doi.org/10.1007/978-981-19-9107-3, the algorithm supports arc and vertex modification (insertion or deletion) in . time where . is the number of arcs involved in the operation. Moreover, if the modified graph remains a directed cograph, the modular tree decomposition is updated; otherwise, a certificate is returned within the same 作者: 喚起 時(shí)間: 2025-3-25 16:12
Modes of the Tragic in Spanish Cinemagraphs (or WPO-graphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic linear-time algorithm for testing for a perfect elimination ordering can be efficiently used to determine in .( min {...(.), . + .. log .}) time whether a g作者: 受傷 時(shí)間: 2025-3-25 20:48 作者: pineal-gland 時(shí)間: 2025-3-26 02:35 作者: 象形文字 時(shí)間: 2025-3-26 06:08 作者: 舉止粗野的人 時(shí)間: 2025-3-26 10:05 作者: 最高點(diǎn) 時(shí)間: 2025-3-26 16:29
https://doi.org/10.1007/978-88-470-2442-7iption logic . in the presence of terminological cycles that are interpreted with descriptive semantics, which is the usual first-order semantics for description logics. In this setting, neither the lcs nor the msc needs to exist. We were able to characterize the cases in which the lcs/msc exists, b作者: Spartan 時(shí)間: 2025-3-26 17:03
https://doi.org/10.1007/978-90-368-1857-5 model this problem as a graph optimization problem, which we call the minimum weight processor assignment problem. We show that our setting generalizes several problems known in literature, including minimum multiway cut, graph .-colorability, and minimum (generalized) vertex covering. We show that作者: forager 時(shí)間: 2025-3-27 00:40 作者: 使成整體 時(shí)間: 2025-3-27 04:06 作者: 凌辱 時(shí)間: 2025-3-27 06:56
Lexicographic Breadth First Search – A Surveygorithmic search paradigm, with applications in recognition of restricted graph families, diameter approximation for restricted families and determining a dominating pair in an AT-free graph. This paper surveys this area and provides new directions for further research in the area of graph searching作者: 范圍廣 時(shí)間: 2025-3-27 11:48
Wireless Networking: Graph Theory Unpluggedeory problems. In particular the rapidly growing areas of ad-hoc and sensor networks demand new solutions for timeless graph theory problems, because i) wireless devices have lower bandwidth and ii) wireless devices are mobile and therefore the topology of the network changes rather frequently. As a作者: AGGER 時(shí)間: 2025-3-27 15:37 作者: Trigger-Point 時(shí)間: 2025-3-27 17:55
Treelike Comparability Graphs: Characterization, Recognition, and Applications treelike comparability graphs are distance hereditary. Utilizing this property, we give a linear time recognition algorithm. We then characterize permutation graphs that are treelike. Finally, we consider the . problem on special subgraphs of treelike permutation graphs.作者: Initial 時(shí)間: 2025-3-28 01:14 作者: 最有利 時(shí)間: 2025-3-28 05:30 作者: 神刊 時(shí)間: 2025-3-28 09:12 作者: Antigen 時(shí)間: 2025-3-28 10:27
Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs, the algorithm supports arc and vertex modification (insertion or deletion) in . time where . is the number of arcs involved in the operation. Moreover, if the modified graph remains a directed cograph, the modular tree decomposition is updated; otherwise, a certificate is returned within the same 作者: Indolent 時(shí)間: 2025-3-28 17:40
Recognizing HHD-free and Welsh-Powell Opposition Graphsgraphs (or WPO-graphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic linear-time algorithm for testing for a perfect elimination ordering can be efficiently used to determine in .( min {...(.), . + .. log .}) time whether a g作者: mucous-membrane 時(shí)間: 2025-3-28 19:39 作者: 推遲 時(shí)間: 2025-3-29 01:55 作者: 茁壯成長 時(shí)間: 2025-3-29 03:43
Decremental Clique Problemthe decremental version of clique problem, where the property of containing an ?-clique is dynamically checked during deletions of nodes. We provide an improved dynamic algorithm for this problem for every fixed value of ? ≥ 3. Our algorithm naturally applies to filtering for the constraint satisfac作者: 規(guī)范要多 時(shí)間: 2025-3-29 07:17 作者: 撫育 時(shí)間: 2025-3-29 11:36
A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Diption logic . in the presence of terminological cycles that are interpreted with descriptive semantics, which is the usual first-order semantics for description logics. In this setting, neither the lcs nor the msc needs to exist. We were able to characterize the cases in which the lcs/msc exists, b作者: Adherent 時(shí)間: 2025-3-29 17:10 作者: 易于 時(shí)間: 2025-3-29 21:14
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphsight independent set problem in unit disk graphs. In contrast to previously known approximation schemes, our approach does not require a geometric representation (specifying the coordinates of the disk centers)..The approximation algorithm presented is robust in the sense that it accepts any graph a作者: 燈泡 時(shí)間: 2025-3-30 02:47
Tolerance Based Algorithms for the ATSPATSP). We derive new tighter lower bounds based on exact and approximate bottleneck upper tolerance values of the Assignment Problem (AP). It is shown that branching by tolerances provides a more rational branching process than branching by costs. Among others, we show that branching on an arc with 作者: 青少年 時(shí)間: 2025-3-30 07:52 作者: Aprope 時(shí)間: 2025-3-30 08:35
https://doi.org/10.1007/978-3-319-33282-6cheme for those graphs. Also, any DSP-graph (there exists a dominating shortest path) admits one additive tree 4-spanner, a system of two collective additive tree 3-spanners and a system of five collective additive tree 2-spanners.作者: PHONE 時(shí)間: 2025-3-30 12:45 作者: 機(jī)制 時(shí)間: 2025-3-30 20:24
Collective Tree Spanners and Routing in AT-free Related Graphscheme for those graphs. Also, any DSP-graph (there exists a dominating shortest path) admits one additive tree 4-spanner, a system of two collective additive tree 3-spanners and a system of five collective additive tree 2-spanners.作者: 小畫像 時(shí)間: 2025-3-30 22:23
Modes of the Tragic in Spanish Cinemalved in .(.) time using .(..) space; this in turn leads to an .(.)-time and .(..)-space algorithm for recognizing WPO-graphs. The previously best algorithms for recognizing HHD-free and WPO-graphs required .(..) time and .(..) space.作者: 排他 時(shí)間: 2025-3-31 02:20
https://doi.org/10.1007/1-4020-3794-5ns. This convenient property is closed under certain graph composition operations. Moreover, an alternative symbolic approach for general integral edge weights is sketched which does not behave efficiently on general graph sequences with bounded-width functions. Finally, two variants of the APSP problem are briefly discussed.作者: Lignans 時(shí)間: 2025-3-31 08:14
https://doi.org/10.1007/978-88-470-2442-7f the lcs and the msc. This is achieved by expressing the property in monadic second-order logic on infinite trees. We also show that, if it exists, then the lcs/msc can be computed in polynomial time.作者: 難聽的聲音 時(shí)間: 2025-3-31 11:12 作者: 過于光澤 時(shí)間: 2025-3-31 14:41 作者: 拋射物 時(shí)間: 2025-3-31 19:21 作者: 輕浮思想 時(shí)間: 2025-3-31 23:20
A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Df the lcs and the msc. This is achieved by expressing the property in monadic second-order logic on infinite trees. We also show that, if it exists, then the lcs/msc can be computed in polynomial time.作者: 只有 時(shí)間: 2025-4-1 05:49 作者: SHOCK 時(shí)間: 2025-4-1 06:39 作者: hematuria 時(shí)間: 2025-4-1 13:39 作者: 要素 時(shí)間: 2025-4-1 17:06 作者: Expand 時(shí)間: 2025-4-1 21:16 作者: forebear 時(shí)間: 2025-4-1 22:53 作者: Intellectual 時(shí)間: 2025-4-2 05:56 作者: Arctic 時(shí)間: 2025-4-2 09:54
