書目名稱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é)科排名
作者: Expand 時(shí)間: 2025-3-21 22:33 作者: Sinus-Node 時(shí)間: 2025-3-22 02:24
https://doi.org/10.1007/0-387-35098-5e suitable for a wide area of applications. A declarative approach to specifying subclasses of TGraphs by a combination of a schematic graphical description and an additional constraint language is given. The implementation of TGraphs by an appropriate software approach is described.作者: FLAT 時(shí)間: 2025-3-22 05:42 作者: 無意 時(shí)間: 2025-3-22 10:26 作者: 平項(xiàng)山 時(shí)間: 2025-3-22 14:08
A declarative approach to graph based modeling,e suitable for a wide area of applications. A declarative approach to specifying subclasses of TGraphs by a combination of a schematic graphical description and an additional constraint language is given. The implementation of TGraphs by an appropriate software approach is described.作者: 平項(xiàng)山 時(shí)間: 2025-3-22 19:05 作者: SPASM 時(shí)間: 2025-3-22 23:52 作者: minion 時(shí)間: 2025-3-23 05:16
https://doi.org/10.1007/978-2-8178-0466-8owing interest in treewidth based methods, this bound has many potential applications..Our bound helps shed new light on the structure of obstructions for width .. As a result, we are able to characterize completely those treewidth obstructions of order .+3. Unexpectedly, we find that these graphs a作者: 強(qiáng)所 時(shí)間: 2025-3-23 06:05 作者: 明確 時(shí)間: 2025-3-23 19:21
Molecular Mechanisms of Cellular Growth(resp. treewidth) approach belongs to this kind of research and bases on a tree structure of constant-size bounded maximal cliques. Without size bound on the cliques this tree structure of maximal cliques characterizes chordal graphs which are known to be important also in connection with relational作者: PLIC 時(shí)間: 2025-3-24 00:52
Molecular Mechanisms of Dementiaion of perfect elimination orderings, so called domination elimination orderings (.). We show that graphs with the property that each induced subgraph has a . (domination graphs) are related to formulas that can be reduced to formulas with a very simple structure. We also show that every brittle gra作者: 百靈鳥 時(shí)間: 2025-3-24 05:55
Molecular Mechanisms of Fanconi Anemia(.)). In this paper, we design efficient algorithms for certain graph covering problems according to two basic techniques. The first one is a reduction to the 2-SAT problem. The second technique exploits necessary and sufficient conditions for the existence of regular factors in graphs. For other in作者: COW 時(shí)間: 2025-3-24 08:10
https://doi.org/10.1007/978-1-4613-1659-6hs of bipartite graphs, and is in turn properly contained in the class of claw-free graphs. We give some characterizations of this class of graphs, show that they can be recognized in linear time, give a linear time algorithm for listing all maximal cliques (which implies a linear time algorithm com作者: FLINT 時(shí)間: 2025-3-24 14:27 作者: defile 時(shí)間: 2025-3-24 16:22 作者: Indolent 時(shí)間: 2025-3-24 22:13 作者: AND 時(shí)間: 2025-3-25 00:48
https://doi.org/10.1007/978-1-4757-5890-0of requirements and software design documents, and it provides more or less sophisticated assistance for keeping these documents in a consistent state. Up to now, almost all data consistency observing or preserving integration tools are hand-crafted due to the lack of generic implementation framewor作者: MAZE 時(shí)間: 2025-3-25 06:36
https://doi.org/10.1007/978-3-030-50160-0eering domains (e.g. electrical, mechanical, and software engineering). This observation has driven us to develop a configuration management model (called CoMa) for managing systems of engineering design documents. The CoMa model integrates composition hierarchies, dependencies, and versions into a 作者: 使害怕 時(shí)間: 2025-3-25 10:07
https://doi.org/10.1007/978-1-4419-0298-6side of the productions. From an algorithmic point of view, confluent and boundary eNCE graph grammars are the most interesting subclasses of eNCE graph grammars. In confluent eNCE graph grammars, the order in which nonterminal nodes are substituted is irrelevant for the resulting graph. In boundary作者: Dislocation 時(shí)間: 2025-3-25 14:43 作者: 輕信 時(shí)間: 2025-3-25 15:52 作者: 安慰 時(shí)間: 2025-3-25 22:19 作者: 煩人 時(shí)間: 2025-3-26 01:26 作者: enmesh 時(shí)間: 2025-3-26 04:29 作者: CLASP 時(shí)間: 2025-3-26 10:52 作者: 蒼白 時(shí)間: 2025-3-26 14:46 作者: CORD 時(shí)間: 2025-3-26 19:27
A declarative approach to graph based modeling,e suitable for a wide area of applications. A declarative approach to specifying subclasses of TGraphs by a combination of a schematic graphical description and an additional constraint language is given. The implementation of TGraphs by an appropriate software approach is described.作者: MIME 時(shí)間: 2025-3-26 23:16
Multilevel graph grammars, are not visible and the information can be restored via the explicit application of productions. The notions of applicability and derivation are investigated and the compatibility of the representations with the derivations is shown. Production mechanisms for multilevel graph are motivated by probl作者: reception 時(shí)間: 2025-3-27 04:57 作者: curriculum 時(shí)間: 2025-3-27 08:04
On domination elimination orderings and domination graphs,ion of perfect elimination orderings, so called domination elimination orderings (.). We show that graphs with the property that each induced subgraph has a . (domination graphs) are related to formulas that can be reduced to formulas with a very simple structure. We also show that every brittle gra作者: ectropion 時(shí)間: 2025-3-27 09:57 作者: forecast 時(shí)間: 2025-3-27 14:04
Dominoes,hs of bipartite graphs, and is in turn properly contained in the class of claw-free graphs. We give some characterizations of this class of graphs, show that they can be recognized in linear time, give a linear time algorithm for listing all maximal cliques (which implies a linear time algorithm com作者: appall 時(shí)間: 2025-3-27 20:02
GLB-closures in directed acyclic graphs and their applications,he glb-closure of . is the smallest glb-closed subset containing .. An efficient output sensitive algorithm for computing glb-closures is presented and two applications in the field of object-oriented programming languages are discussed.作者: 小教堂 時(shí)間: 2025-3-28 01:58 作者: 寵愛 時(shí)間: 2025-3-28 03:26 作者: 滑動(dòng) 時(shí)間: 2025-3-28 07:18
Specification of graph translators with triple graph grammars,of requirements and software design documents, and it provides more or less sophisticated assistance for keeping these documents in a consistent state. Up to now, almost all data consistency observing or preserving integration tools are hand-crafted due to the lack of generic implementation framewor作者: Palpable 時(shí)間: 2025-3-28 13:50
Using programmed graph rewriting for the formal specification of a configuration management system,eering domains (e.g. electrical, mechanical, and software engineering). This observation has driven us to develop a configuration management model (called CoMa) for managing systems of engineering design documents. The CoMa model integrates composition hierarchies, dependencies, and versions into a 作者: 擴(kuò)大 時(shí)間: 2025-3-28 16:32 作者: 偽造者 時(shí)間: 2025-3-28 18:52 作者: 地牢 時(shí)間: 2025-3-28 23:33 作者: Collar 時(shí)間: 2025-3-29 04:11 作者: configuration 時(shí)間: 2025-3-29 07:42
The maximal ,-dependent set problem for planar graphs is in NC,d a maximal subset . of . such that no vertex . has degree>.(.) in the subgraph induced by .. Whether the problem is in . (or .) or not is an open question. Concerning this question, only a rather trivial result due to Diks, Garrido, and Lingas is known up to now, which says that the problem can be 作者: incredulity 時(shí)間: 2025-3-29 14:12 作者: GILD 時(shí)間: 2025-3-29 18:39
Dominoes,ow that they can be recognized in linear time, give a linear time algorithm for listing all maximal cliques (which implies a linear time algorithm computing a maximum clique of a domino) and show that the PATHWIDTH problem remains NP-complete when restricted to the class of chordal dominoes.作者: 熱心 時(shí)間: 2025-3-29 22:22
Minimum vertex cover, distributed decision-making, and communication complexity,re . is the number of processors. In the second framework two processors are allowed to communicate in order to find an approximate solution: in this latter case, we show a linear lower bound on the communication complexity of the problem.作者: 揮舞 時(shí)間: 2025-3-30 00:35 作者: BALE 時(shí)間: 2025-3-30 05:05
https://doi.org/10.1007/978-2-8178-0466-8bstruction of order .+2 for width ., we find that the number of obstructions of order .+3 alone is an asymptotically exponential function of .. Our proof of this is based on the theory of partitions of integers and is the first non-trivial lower bound on the number of obstructions for treewidth.作者: lipids 時(shí)間: 2025-3-30 11:18
https://doi.org/10.1007/978-1-4757-5890-0dependencies between graph-like data structures on a very high level. Furthermore, they are the fundamentals of a new machinery for the production of batch-oriented as well as incrementally working data integration tools.作者: SEVER 時(shí)間: 2025-3-30 15:53
https://doi.org/10.1007/978-3-030-50160-0e CoMa model is defined in a high-level, multi-paradigm specification language (PROGRES) which combines concepts from various disciplines (database systems, knowledge-based systems, graph rewriting systems, programming languages).作者: 苦笑 時(shí)間: 2025-3-30 18:48
Alexander Dityatev,Alaa El-Husseiniber of processors. We then go on to show that this lower bound is tight. We also show that the task of reconstructing .-node binary trees from their traversais can be performed in O(1) time on the same architecture. Our algorithms rely on novel time-optimal algorithms on sequences of parentheses that we also develop.作者: babble 時(shí)間: 2025-3-31 00:10
A lower bound for treewidth and its consequences,bstruction of order .+2 for width ., we find that the number of obstructions of order .+3 alone is an asymptotically exponential function of .. Our proof of this is based on the theory of partitions of integers and is the first non-trivial lower bound on the number of obstructions for treewidth.作者: agnostic 時(shí)間: 2025-3-31 01:51 作者: compose 時(shí)間: 2025-3-31 08:03 作者: jaundiced 時(shí)間: 2025-3-31 12:04
Time-optimal tree computations on sparse meshes,ber of processors. We then go on to show that this lower bound is tight. We also show that the task of reconstructing .-node binary trees from their traversais can be performed in O(1) time on the same architecture. Our algorithms rely on novel time-optimal algorithms on sequences of parentheses that we also develop.作者: Gnrh670 時(shí)間: 2025-3-31 14:33 作者: 捏造 時(shí)間: 2025-3-31 19:12
https://doi.org/10.1007/978-1-4613-1659-6ow that they can be recognized in linear time, give a linear time algorithm for listing all maximal cliques (which implies a linear time algorithm computing a maximum clique of a domino) and show that the PATHWIDTH problem remains NP-complete when restricted to the class of chordal dominoes.作者: Valves 時(shí)間: 2025-3-31 23:59 作者: ADJ 時(shí)間: 2025-4-1 04:53 作者: Permanent 時(shí)間: 2025-4-1 07:16 作者: 輕打 時(shí)間: 2025-4-1 10:16 作者: calamity 時(shí)間: 2025-4-1 14:37
Molecular Mechanisms of Fanconi Anemiafinite classes of graph covering problems we derive .-completeness results by reductions from graph coloring problems. We illustrate this methodology by classifying all graph covering problems defined by simple graphs with at most 6 vertices.作者: locus-ceruleus 時(shí)間: 2025-4-1 20:36
https://doi.org/10.1007/978-1-4419-0298-6 eNCE graph grammars, nonterminal nodes are never adjacent. In this paper, we show that given a confluent or boundary eNCE graph grammar ., the problem whether the language . defined by . is empty, is DEXPTIME-complete.作者: Lethargic 時(shí)間: 2025-4-2 01:23
https://doi.org/10.1007/978-94-011-1506-3solved in . if the maximum value of . is poly-logarithmic in the input size [., LNCS . (1991) 385–395]. In this paper, we show a nontrivial interesting result that the Max-.-DS problem for planar graphs can be solved in .(log..) time with . processors on a CRCW PRAM, where . is the input size.作者: Ccu106 時(shí)間: 2025-4-2 05:06
Domino treewidth,lgorithms that — for fixed . — decide whether a given graph . has domino treewidth at most .. If . is not fixed, this problem is NP-complete. The domino treewidth problem is hard for the complexity classes .[.] for all . ξ ., and hence the problem for fixed . is unlikely to be solvable in .(..), where . is a constant, not depending on ..作者: Fissure 時(shí)間: 2025-4-2 08:46
