書目名稱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é)科排名
作者: 不能約 時(shí)間: 2025-3-21 21:57
https://doi.org/10.1007/978-1-4613-1143-0-element chains (resp. antichains). We show that .., ., is NP-complete even for N-free ordered sets of length at most .. and .. are polynomial for series-paralel orders and .. is polynomial for interval orders. We also consider related problems for graphs.作者: GIBE 時(shí)間: 2025-3-22 04:11
Molecular Biology of Plant Viruseshat the optimal ordering problem can be transformed into the well-known minimum-weight spanning tree problem. Some properties of optimal vertex orderings are investigated. And finally, the application of the optimal vertex ordering technique to an algorithm for detecting the symmetry of polyhedra is discussed in some detail.作者: Anhydrous 時(shí)間: 2025-3-22 07:16 作者: 透明 時(shí)間: 2025-3-22 10:05 作者: 責(zé)任 時(shí)間: 2025-3-22 14:20
On complexity of some chain and antichain partition problems,-element chains (resp. antichains). We show that .., ., is NP-complete even for N-free ordered sets of length at most .. and .. are polynomial for series-paralel orders and .. is polynomial for interval orders. We also consider related problems for graphs.作者: 責(zé)任 時(shí)間: 2025-3-22 18:09 作者: 相反放置 時(shí)間: 2025-3-23 00:59 作者: PHON 時(shí)間: 2025-3-23 02:42
Graph-Theoretic Concepts in Computer Science978-3-540-46735-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: diabetes 時(shí)間: 2025-3-23 05:54
Molecular Biology of Human CancersWe propose a new kind of Graph Rewriting Systems (GRS) that provide a theoretical foundation for using the reduction methods to analyze network reliability, and give the critical pair lemma in this paper.作者: 浪費(fèi)時(shí)間 時(shí)間: 2025-3-23 13:21 作者: N斯巴達(dá)人 時(shí)間: 2025-3-23 17:16 作者: resistant 時(shí)間: 2025-3-23 19:38 作者: 馬籠頭 時(shí)間: 2025-3-24 01:14
https://doi.org/10.1007/978-981-99-9660-5orithm of Leighton et al. that finds vertex separators of graphs. The approximate values of the parameters, which include minimum front size, treewidth, pathwidth, and minimum elimination tree height, are no more than .(log .) (minimum front size and treewidth) and .(log..) (pathwidth and minimum el作者: 束以馬具 時(shí)間: 2025-3-24 02:38
Molecular Biology of Hematopoiesis 6jor result is that the complete binary tree can be embedded into the square grid of the same size with almost optimal dilation (up to a very small factor). To achieve this, we first state an embedding of the complete binary tree into the line with optimal dilation.作者: contrast-medium 時(shí)間: 2025-3-24 08:38 作者: 做事過頭 時(shí)間: 2025-3-24 11:55 作者: 或者發(fā)神韻 時(shí)間: 2025-3-24 15:28 作者: Flatus 時(shí)間: 2025-3-24 22:58 作者: fiction 時(shí)間: 2025-3-25 00:51 作者: 籠子 時(shí)間: 2025-3-25 06:39 作者: 大量 時(shí)間: 2025-3-25 10:01
https://doi.org/10.1007/978-1-4899-1146-9efine a Voronoi diagram. As the points move, the Voronoi diagram changes continuously, but at certain critical instants in time, topological . occur that cause a change in the Delaunay diagram. In this paper, we present a method of . the Voronoi diagram over time, while showing that the number of to作者: 租約 時(shí)間: 2025-3-25 13:55 作者: 發(fā)生 時(shí)間: 2025-3-25 15:58 作者: 侵略者 時(shí)間: 2025-3-25 21:41 作者: Occupation 時(shí)間: 2025-3-26 01:46
https://doi.org/10.1007/978-1-4612-1764-0es ..,..., .. and . positive integers ..,..., .. such that ?.r.= ., there exist . node-disjoint paths of length at most . from . to the .., where .. of them end at ... This concept contains, and is related to, many important concepts used in communications and graph theory. The line digraph of a dig作者: ORBIT 時(shí)間: 2025-3-26 08:16
Molecular Biology of Valvular Heart Diseaseth 0 and 1), but a probability of this event is very low. Such a generalization is sufficient for a large number of applications..An implementation of the scheme presented in the paper is based on random graphs. From the point of view of the worst-case complexity, the problem of decrypting is provab作者: cruise 時(shí)間: 2025-3-26 11:38
Respiratory Pharmacology and Pharmacotherapyertex, is complete for deterministic logspace via projection translations: such translations are extremely weak forms of reductions. Other related problems involving constrained versions of the lexicographically first path problem in both digraphs and graphs are also shown to be similarly complete. 作者: Monocle 時(shí)間: 2025-3-26 14:09
Approximating treewidth, pathwidth, and minimum elimination tree height,orithm of Leighton et al. that finds vertex separators of graphs. The approximate values of the parameters, which include minimum front size, treewidth, pathwidth, and minimum elimination tree height, are no more than .(log .) (minimum front size and treewidth) and .(log..) (pathwidth and minimum el作者: VOK 時(shí)間: 2025-3-26 18:18
Optimal embedding of complete binary trees into lines and grids,jor result is that the complete binary tree can be embedded into the square grid of the same size with almost optimal dilation (up to a very small factor). To achieve this, we first state an embedding of the complete binary tree into the line with optimal dilation.作者: 敲竹杠 時(shí)間: 2025-3-26 22:22
Nondeterministic control structures for graph rewriting systems,ct .rected, .ttributed, .ode- and .dge- labeled graphs (diane graphs) are used to model the internal structure of software documents and .grammed .raph .writing .tems are used to specify the operational behavior of document processing tools like syntax-directed editors, static analyzers, or incremen作者: 配偶 時(shí)間: 2025-3-27 01:12
A language for generic graph-transformations,ations of these graphs. We therefore first define five transformation-operations on this graph-class. Then we define . as a natural generalization of the concept of BP-completeness, originally defined for the relational database model. Our main result states that the language consisting of the five 作者: upstart 時(shí)間: 2025-3-27 08:18
Attributed elementary programmed graph grammars,raph productions, namely the addition, the deletion and the renaming of a node or an edge. Although these elementary graph productions are acting strictly locally and no embedding transformations are needed, in the unrestricted and monotone case, elementary programmed graph grammars have the same ge作者: 洞察力 時(shí)間: 2025-3-27 10:25
The complexity of approximating the class Steiner tree problem,ode of each required class. This problem called . is NP-hard and therefore we are dependent on approximation..In this paper, we investigate various restrictions of the problem comparing their complexities with respect to approximability. A main result is that for an input of trees without Steiner no作者: jocular 時(shí)間: 2025-3-27 14:50
On complexity of some chain and antichain partition problems,-element chains (resp. antichains). We show that .., ., is NP-complete even for N-free ordered sets of length at most .. and .. are polynomial for series-paralel orders and .. is polynomial for interval orders. We also consider related problems for graphs.作者: Invigorate 時(shí)間: 2025-3-27 20:52
Tight bounds for the rectangular art gallery problem, are always sufficient to protect all rooms in a rectangular art gallery; furthermore, their positioning can be determined in O(n) time. We show that the optimal positioning of the guards can be determined in linear time. We extend the result by proving that in an arbitrary orthogonal art gallery (n作者: paltry 時(shí)間: 2025-3-27 23:31
Voronoi diagrams of moving points in the plane,efine a Voronoi diagram. As the points move, the Voronoi diagram changes continuously, but at certain critical instants in time, topological . occur that cause a change in the Delaunay diagram. In this paper, we present a method of . the Voronoi diagram over time, while showing that the number of to作者: FLAGR 時(shí)間: 2025-3-28 03:53
Using maximal independent sets to solve problems in parallel,e maximal vertex-induced subgraph satisfying a hereditary graph property π can be found in time .(Δ...(.)(log .).) using a polynomial number of processors, where λ(π) is the maximum of diameters of minimal graphs violating π and ..(.) is the time needed to decide whether a graph with . vertices sati作者: 減少 時(shí)間: 2025-3-28 08:20 作者: 護(hù)航艦 時(shí)間: 2025-3-28 11:25 作者: 閑逛 時(shí)間: 2025-3-28 18:35
,Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, aes ..,..., .. and . positive integers ..,..., .. such that ?.r.= ., there exist . node-disjoint paths of length at most . from . to the .., where .. of them end at ... This concept contains, and is related to, many important concepts used in communications and graph theory. The line digraph of a dig作者: regale 時(shí)間: 2025-3-28 19:18
A generalized encryption scheme based on random graphs,th 0 and 1), but a probability of this event is very low. Such a generalization is sufficient for a large number of applications..An implementation of the scheme presented in the paper is based on random graphs. From the point of view of the worst-case complexity, the problem of decrypting is provab作者: anatomical 時(shí)間: 2025-3-29 00:34 作者: 盤旋 時(shí)間: 2025-3-29 06:33
https://doi.org/10.1007/978-981-99-9660-5imination tree height) times the optimal values. In addition we examine the existence of bounded approximation algorithms for the parameters, and show that unless ., there are no absolute approximation algorithms for them.作者: SPER 時(shí)間: 2025-3-29 11:14
https://doi.org/10.1007/978-3-030-17086-8nerative power as expression graph grammars. As a graph with attributes assigned to its nodes and edges is an even more useful tool for the description of certain data structures than a directed graph, attributed elementary programmed graph grammars turn out to be adequate graph rewriting systems applicable in many areas of computer science.作者: 初學(xué)者 時(shí)間: 2025-3-29 13:28 作者: 滲透 時(shí)間: 2025-3-29 17:48
https://doi.org/10.1007/978-1-4757-0893-6ot necessarily convex, possibly having holes) with n rectangular rooms and k walls, ?(n + k)/2? guards are always sufficient and occasionally necessary to guard all the rooms in our gallery. A linear time algorithm to find the positioning of the guards is obtained.作者: GIST 時(shí)間: 2025-3-29 22:58 作者: fixed-joint 時(shí)間: 2025-3-30 01:43 作者: ANTIC 時(shí)間: 2025-3-30 05:55 作者: 地牢 時(shí)間: 2025-3-30 09:04 作者: 完成才能戰(zhàn)勝 時(shí)間: 2025-3-30 13:08 作者: 人類的發(fā)源 時(shí)間: 2025-3-30 17:08 作者: 高談闊論 時(shí)間: 2025-3-30 22:20
Developments in Molecular Virologythe concept of BP-completeness, originally defined for the relational database model. Our main result states that the language consisting of the five transformation-operations expresses exactly the generic transformations.作者: parasite 時(shí)間: 2025-3-31 02:22 作者: 失誤 時(shí)間: 2025-3-31 05:25 作者: fetter 時(shí)間: 2025-3-31 09:27
A generalized encryption scheme based on random graphs,e polynomial time deterministic or probabilistic decoding algorithms with probability of success bounded away form 1/2. It is shown that some obvious polynomial time attacks are too weak to break the scheme with sufficiently large probability.作者: Preserve 時(shí)間: 2025-3-31 13:31
A language for generic graph-transformations,the concept of BP-completeness, originally defined for the relational database model. Our main result states that the language consisting of the five transformation-operations expresses exactly the generic transformations.作者: 發(fā)牢騷 時(shí)間: 2025-3-31 20:57 作者: 羞辱 時(shí)間: 2025-4-1 01:06
Nondeterministic control structures for graph rewriting systems,guage of PROGRESS for composing complex graph . and graph transformations (.) out of simple subgraph . and graph rewriting rules (.). It also contains a formal definition of this sublanguage by mapping its main control structures onto so-called nondeterministic control flow graphs. We believe that t作者: anarchist 時(shí)間: 2025-4-1 05:55
Voronoi diagrams of moving points in the plane,r the naive quartic bound on the number of topological events..In addition, we show that if only . points are moving (while leaving the other . points fixed), there is an upper bound of O(. λ.(.) + (n?.). λ.(.)) on the number of topological events, which is nearly quadratic if . is constant..We give
