書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學科排名
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡公開度
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡公開度學科排名
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次學科排名
書目名稱Graph-Theoretic Concepts in Computer Science年度引用
書目名稱Graph-Theoretic Concepts in Computer Science年度引用學科排名
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學科排名
作者: Inculcate 時間: 2025-3-22 00:12 作者: 容易生皺紋 時間: 2025-3-22 03:35 作者: right-atrium 時間: 2025-3-22 05:27 作者: aerial 時間: 2025-3-22 11:38 作者: ARCHE 時間: 2025-3-22 16:34
Recognizing Threshold Tolerance Graphs in , Time,fficient recognition algorithm for threshold tolerance graphs is the algorithm of Monma, Reed, and Trotter which has an . runtime. We give an . algorithm for recognizing threshold tolerance and their complements, the co-threshold tolerance (co-TT) graphs, resolving an open question of Golumbic, Weingarten, and Limouzy.作者: ARCHE 時間: 2025-3-22 18:30 作者: exquisite 時間: 2025-3-23 00:17 作者: Watemelon 時間: 2025-3-23 03:58
Distributedly Testing Cycle-Freeness,me central authority (like in, e.g., sensor networks). In local distributed testing, each node can provide the central authority with just a few information about what it perceives from its neighboring environment, and, based on the collected information, the central authority is aiming at deciding 作者: Dignant 時間: 2025-3-23 09:19 作者: 停止償付 時間: 2025-3-23 11:07 作者: 杠桿 時間: 2025-3-23 14:36
Vertex Contact Graphs of Paths on a Grid,y disjoint grid-paths. Adjacencies are represented by contacts between an . of one grid-path and an . of another grid-path. Defining . if the path of . ends on path of . we obtain an orientation on . from a VCPG. To get hand on the bends of the grid path the orientation is not enough. We therefore c作者: Mumble 時間: 2025-3-23 20:38
Deciding the Bell Number for Hereditary Graph Properties,e speed of hereditary graph properties to the Bell number?. and provides a partial characterisation of the family of minimal classes whose speed is at least?.. In the present paper, we give a complete characterisation of this family. Since this family is infinite, the decidability of the problem of 作者: neurologist 時間: 2025-3-23 22:48
Boxicity and Separation Dimension,n . in which all the vertices in one edge precede those in the other. The cardinality of a smallest such family of permutations for . is called the . of . and is denoted by .. Equivalently, . is the smallest natural number . so that the vertices of . can be embedded in . such that any two disjoint e作者: deforestation 時間: 2025-3-24 04:55 作者: Pigeon 時間: 2025-3-24 09:13 作者: mighty 時間: 2025-3-24 12:40 作者: 拋射物 時間: 2025-3-24 15:43 作者: 脾氣暴躁的人 時間: 2025-3-24 19:26 作者: AGOG 時間: 2025-3-25 03:14 作者: 營養(yǎng) 時間: 2025-3-25 04:08
Minimum Spanning Tree Verification Under Uncertainty,lue. An . of an input item reveals its exact value. If the exact value is equal to the assumed value, we say that the update . the assumed value. We consider verification under uncertainty for the minimum spanning tree (MST) problem for undirected weighted graphs, where each edge is associated with 作者: RAGE 時間: 2025-3-25 07:29 作者: Resection 時間: 2025-3-25 14:25
On Set Expansion Problems and the Small Set Expansion Conjecture,irected simple graph . with integral vertex weights. The goal is to select a set . of maximum weight so that the number of edges with at least one endpoint in . is at most .. Goldschmidt and Hochbaum [.] show that the problem is NP-hard and they give a .-approximation algorithm for the problem. The 作者: Cholagogue 時間: 2025-3-25 16:18
Hadwiger Number of Graphs with Small Chordality, Hadwiger number of a graph is .-hard on co-bipartite graphs, but can be solved in polynomial time on cographs and on bipartite permutation graphs. We also consider a natural generalization of this problem that asks for the largest integer?. such that?. has a minor with?. vertices and diameter at mo作者: 極微小 時間: 2025-3-25 21:05 作者: ANTE 時間: 2025-3-26 02:09
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time,either common vertices nor adjacent vertices (except perhaps their ends) for .. We present a linear-time algorithm that solves . and finds the corresponding paths (if they exist) on circular-arc graphs. For interval graphs, we exhibit a linear-time algorithm for the generalization of . where the pai作者: Daily-Value 時間: 2025-3-26 06:36
https://doi.org/10.1007/978-3-030-92152-1s for path-width, tree-width, branch-width and rank-width, and gives rise to new width parameters with associated duality theorems. The dense substructures witnessing large width are presented in a unified way akin?to tangles, as orientations of separation systems satisfying certain consistency axio作者: LINE 時間: 2025-3-26 08:41 作者: 溫和女人 時間: 2025-3-26 14:36
https://doi.org/10.1007/978-1-4615-8783-5 in an environment that may change rapidly and unpredictably during the agents’ navigation. We apply recent formulations of time-varying graphs (TVGs) to DMVP, shedding new light on the computational hierarchy . of TVG classes by analyzing them in the context of graph navigation. We provide hardness作者: mutineer 時間: 2025-3-26 18:01 作者: CAND 時間: 2025-3-26 22:03 作者: HALL 時間: 2025-3-27 03:45
https://doi.org/10.1007/978-3-0348-8948-3e speed of hereditary graph properties to the Bell number?. and provides a partial characterisation of the family of minimal classes whose speed is at least?.. In the present paper, we give a complete characterisation of this family. Since this family is infinite, the decidability of the problem of 作者: eustachian-tube 時間: 2025-3-27 05:33 作者: Hdl348 時間: 2025-3-27 11:50
Deepak Bhatnagar,Thomas E. Clevelandmal induced matchings, and this bound is best possible. We prove that every .-vertex triangle-free graph has at most . maximal induced matchings, and this bound is attained by every disjoint union of copies of the complete bipartite graph .. Our result implies that all maximal induced matchings in a作者: 饒舌的人 時間: 2025-3-27 14:42
https://doi.org/10.1007/978-94-011-4928-0le to transform . into . by adding and removing vertices one-by-one, while maintaining an independent set of size at least . throughout? This problem is known to be PSPACE-hard in general. For the case that . is a cograph on . vertices, we show that it can be solved in polynomial time. More generall作者: 駕駛 時間: 2025-3-27 19:57 作者: Nomadic 時間: 2025-3-28 01:10
Topics in Molecular and Structural Biologyes the search for special structural properties of .-free graphs, including alternative characterizations..Let . be a connected .-free graph, .. We show that . admits a connected dominating set whose induced subgraph is either .-free, or isomorphic to .. Surprisingly, it turns out that every minimum作者: 勤勉 時間: 2025-3-28 05:58
https://doi.org/10.1007/978-1-349-12356-8 and horizontal segments. It is known that such representations can be drawn in linear time, we here wonder whether it is as easy to decide whether a partial representation can be completed to a representation of the whole graph. We show that in each of the cases above, this problem becomes NP-hard.作者: 有發(fā)明天才 時間: 2025-3-28 09:56
Molecular Aspects of Cancer and its Therapy collects a maximum number of distinct labels. Our main results are a .-approximation algorithm for this problem and a self-reduction showing that any constant ratio approximation algorithm for this problem can be converted into a PTAS. This last result, combined with the .-hardness of the problem, 作者: Enervate 時間: 2025-3-28 12:35 作者: Arrhythmia 時間: 2025-3-28 16:13 作者: Stricture 時間: 2025-3-28 22:38 作者: 預兆好 時間: 2025-3-29 00:14
Molecular Aspects of Membrane Phenomena Hadwiger number of a graph is .-hard on co-bipartite graphs, but can be solved in polynomial time on cographs and on bipartite permutation graphs. We also consider a natural generalization of this problem that asks for the largest integer?. such that?. has a minor with?. vertices and diameter at mo作者: 撤退 時間: 2025-3-29 04:51 作者: deface 時間: 2025-3-29 11:08
Molecular Aspects of Papovaviruseseither common vertices nor adjacent vertices (except perhaps their ends) for .. We present a linear-time algorithm that solves . and finds the corresponding paths (if they exist) on circular-arc graphs. For interval graphs, we exhibit a linear-time algorithm for the generalization of . where the pai作者: 有罪 時間: 2025-3-29 14:46 作者: Psa617 時間: 2025-3-29 18:38
Molecular Aspects of Cancer and its Therapy constant ratio approximation algorithm for this problem can be converted into a PTAS. This last result, combined with the .-hardness of the problem, shows that the problem cannot be approximated within a constant ratio unless ..作者: 1FAWN 時間: 2025-3-29 20:56
Molecular Aspects of Membrane Phenomena also consider a natural generalization of this problem that asks for the largest integer?. such that?. has a minor with?. vertices and diameter at most .. We show that this problem can be solved in polynomial time on AT-free graphs when ., but is .-hard on chordal graphs for every fixed ..作者: hidebound 時間: 2025-3-30 00:31 作者: 很像弓] 時間: 2025-3-30 06:10 作者: 作繭自縛 時間: 2025-3-30 08:35 作者: 引起痛苦 時間: 2025-3-30 15:47
https://doi.org/10.1007/978-1-4615-8783-5 ., limited approximability in ., and tractability in .. We also give topologies in which DMVP in . is fixed parameter tractable, which may serve as a first step toward fully characterizing the features that make DMVP difficult.作者: BUCK 時間: 2025-3-30 19:32
Molecular Applications in Cytologyeditary graphs which contains the set of distance-hereditary vertex-minor obstructions for linear rank-width. The set given in [Jeong, Kwon, Oum: Excluded vertex-minors for graphs of linear rank-width at most k. STACS 2013: 221–232] is a subset of our obstruction set.作者: 獨特性 時間: 2025-3-30 22:52 作者: evasive 時間: 2025-3-31 02:14 作者: N防腐劑 時間: 2025-3-31 05:01
Linear Rank-Width of Distance-Hereditary Graphs,editary graphs which contains the set of distance-hereditary vertex-minor obstructions for linear rank-width. The set given in [Jeong, Kwon, Oum: Excluded vertex-minors for graphs of linear rank-width at most k. STACS 2013: 221–232] is a subset of our obstruction set.作者: Polydipsia 時間: 2025-3-31 10:04
Deciding the Bell Number for Hereditary Graph Properties, defined by finitely many forbidden induced subgraphs. In other words, we show that there exists an algorithm which, given a finite set?. of graphs, decides whether the speed of the class of graphs containing no induced subgraphs from the set?. is above or below the Bell number.作者: 藥物 時間: 2025-3-31 17:05 作者: pulmonary 時間: 2025-3-31 20:53
https://doi.org/10.1007/978-94-011-4928-0y, we show that for a graph class . that includes all chordal and claw-free graphs, the problem can be solved in polynomial time for graphs that can be obtained from a collection of graphs from . using disjoint union and complete join operations.作者: 枕墊 時間: 2025-4-1 01:16
Topics in Molecular and Structural Biologyex cover number. Moreover, we show that . admits an additive .-approximation when parameterized by the pathwidth of the input graph..Finally, we provide evidence in favor of a conjecture of Adiga et?al. [.]?that . remains NP-complete even on graphs of constant treewidth.作者: 碳水化合物 時間: 2025-4-1 03:11 作者: RACE 時間: 2025-4-1 07:45
Independent Set Reconfiguration in Cographs,y, we show that for a graph class . that includes all chordal and claw-free graphs, the problem can be solved in polynomial time for graphs that can be obtained from a collection of graphs from . using disjoint union and complete join operations.
