書目名稱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讀者反饋學科排名
作者: CEDE 時間: 2025-3-21 21:04
https://doi.org/10.1057/9781137265142ations in terms of their effect on these graph models. This paper informally introduces PROGRESS‘ underlying graph grammar formalism and demonstrates its systematic use by specifying parts of a desk calculator‘s functional behaviour.作者: 灰心喪氣 時間: 2025-3-22 02:57 作者: monopoly 時間: 2025-3-22 06:02 作者: 整潔 時間: 2025-3-22 11:01 作者: Endoscope 時間: 2025-3-22 13:47
Introduction to PROGRESS, an attribute graph grammar based specification language,ations in terms of their effect on these graph models. This paper informally introduces PROGRESS‘ underlying graph grammar formalism and demonstrates its systematic use by specifying parts of a desk calculator‘s functional behaviour.作者: Endoscope 時間: 2025-3-22 20:00
On the complexity of optimal drawings of graphs,ar has an associated placement component. By an extension of the parsing process we can compute a placement of the vertices of each generated graph, which is consistent with the associated placement component, and is area minimal. For connected graphs of bounded degree this can be done in polynomial作者: Observe 時間: 2025-3-23 00:00 作者: 繼承人 時間: 2025-3-23 01:30 作者: projectile 時間: 2025-3-23 08:52
https://doi.org/10.1007/9781349160778". These relations are called .. The theory of graphoids uncovers the axiomatic basis of informational dependencies and ties it to vertex separation in graphs. In this paper we advance towards a characterization of graphoids by families of graphs. Given two graphs . and ., let . be the set of all in作者: gentle 時間: 2025-3-23 10:25 作者: Wallow 時間: 2025-3-23 14:07 作者: 肌肉 時間: 2025-3-23 19:35
https://doi.org/10.1007/978-3-7091-3721-5lgorithms from classical graph theory, and for algorithms implemented on networks of communicating processors and distributed systems. Moreover, this theory gives an algebraic model which allows us to mathematically prove properties of distributed algorithms.作者: 有角 時間: 2025-3-23 22:39
https://doi.org/10.1007/978-1-349-18070-7in be generated by a hyperedge-replacement grammar. Because many familiar graph-theoretic properties like connectedness, .-colorability, planarity, the existence of Eulerian and Hamiltonian paths and cycles, etc. are compatible and compatibility is closed under Boolean operations, the members of a h作者: 遺傳 時間: 2025-3-24 05:25 作者: figure 時間: 2025-3-24 07:35 作者: BAIL 時間: 2025-3-24 12:13 作者: Militia 時間: 2025-3-24 18:09
https://doi.org/10.1007/978-3-031-47884-0or (1) we propose grid embeddings of graphs and measure ”nice” by algorithmic cost measures of the embeddings, e.g., area, expansion, edge length, etc. For (2) we prove that optimal embeddings with fixed costs are NP-complete, even for binary trees. This sharpens previous NP-completeness results of 作者: 反抗者 時間: 2025-3-24 19:18
https://doi.org/10.1007/978-3-031-31104-8rected distance graph with groups of required vertices and Steiner vertices, find a shortest connected subgraph containing at least one required vertex of each group. We propose two efficient approximation algorithms computing different approximate solutions in time .(|.| + |.|log|.|) and in time .(作者: concert 時間: 2025-3-25 01:17
https://doi.org/10.1007/978-3-031-31111-6thm which requires O(n.) time. However, in the average case, C.(G) is computed by this algorithm for almost all integers k (in the asymptotic sense) with O ≦ k ≦ 2n ? 2 in O(n.) time. We next present a parallel algorithm which requires O(n. log n) time. In the average case, this algorithm computes C作者: 滑動 時間: 2025-3-25 07:10
https://doi.org/10.1007/978-3-662-08801-2xed upper bound on the treewidth of the graphs in the class, i.e. if there is a planar graph not in the class, then the class can be recognized in .(..) time. However, this result is non-constructive in two ways: the algorithm only decides on membership, but does not construct ‘a(chǎn) solution’, e.g. a l作者: 經(jīng)典 時間: 2025-3-25 08:52
https://doi.org/10.1007/978-3-319-22404-6ame transitive closure as . but itself not contains a proper subgraph .. with the same property too. The algorithm uses depth-first search and two graph transformations preserving the transitive closure to achieve a time bound of .(. + .), where . stands for the number of vertices and . is the numbe作者: BOLT 時間: 2025-3-25 12:21
https://doi.org/10.1007/978-1-4684-1923-8ce must be (at least partially) paged on secondary storage. The PPbin tree principle can be applied to balanced as well as unbalanced binary trees. Paging a balanced binary tree results in a balanced external binary tree. However, main advantage of the new principle is that even for unbalanced binar作者: MAZE 時間: 2025-3-25 18:28 作者: Fierce 時間: 2025-3-25 20:49 作者: 怎樣才咆哮 時間: 2025-3-26 00:11 作者: Granular 時間: 2025-3-26 08:22
On hyperedge replacement and BNLC graph grammars, grammars. This does not hold if the vertex labelling is taken into account. Vice versa hyperedge replacement grammars generate the same languages of simple graphs as . grammars of bounded nonterminal degree. Furthermore the generation of loops and multiple edges by hyperedege replacement grammars i作者: FLIRT 時間: 2025-3-26 12:19
Graph rewriting systems with priorities,lgorithms from classical graph theory, and for algorithms implemented on networks of communicating processors and distributed systems. Moreover, this theory gives an algebraic model which allows us to mathematically prove properties of distributed algorithms.作者: nugatory 時間: 2025-3-26 14:57
Filtering hyperedge-replacement languages through compatible properties,in be generated by a hyperedge-replacement grammar. Because many familiar graph-theoretic properties like connectedness, .-colorability, planarity, the existence of Eulerian and Hamiltonian paths and cycles, etc. are compatible and compatibility is closed under Boolean operations, the members of a h作者: Visual-Field 時間: 2025-3-26 17:38 作者: Spinal-Tap 時間: 2025-3-26 23:02
A parser for context free plex grammars,er for context free plex grammars. The parser is an extension of Earley‘s algorithm, which was originally developed for context free string grammars. Our parser is able to recognize not only complete structures generated by a plex grammar but also partial ones. The algorithm has been implemented and作者: 慢跑 時間: 2025-3-27 03:11
Introduction to PROGRESS, an attribute graph grammar based specification language,pports a . style of programming (by means of attribute equations), an . style of programming (by supporting multiple inheritance and dynamic bind of attribute designators to their value defining equations), a . style of programming (by using graph rewrite rules), and an . style of programming (by co作者: 拍翅 時間: 2025-3-27 08:11
On the complexity of optimal drawings of graphs,or (1) we propose grid embeddings of graphs and measure ”nice” by algorithmic cost measures of the embeddings, e.g., area, expansion, edge length, etc. For (2) we prove that optimal embeddings with fixed costs are NP-complete, even for binary trees. This sharpens previous NP-completeness results of 作者: Cholecystokinin 時間: 2025-3-27 09:26 作者: insecticide 時間: 2025-3-27 14:34 作者: Admire 時間: 2025-3-27 18:16
Improved self-reduction algorithms for graphs with bounded treewidth,xed upper bound on the treewidth of the graphs in the class, i.e. if there is a planar graph not in the class, then the class can be recognized in .(..) time. However, this result is non-constructive in two ways: the algorithm only decides on membership, but does not construct ‘a(chǎn) solution’, e.g. a l作者: incredulity 時間: 2025-3-28 00:36 作者: calamity 時間: 2025-3-28 05:21 作者: Chronological 時間: 2025-3-28 09:51
,Toward a complete representation of graphoids in graphs — Abridged Version,n graphs. In this paper we advance towards a characterization of graphoids by families of graphs. Given two graphs . and ., let . be the set of all independencies which are implied by . and . under closure by the 5 graphoid axioms (defined in the text). We show the following results:作者: Resistance 時間: 2025-3-28 12:16 作者: pulse-pressure 時間: 2025-3-28 18:20
Describing distributed systems by categorical graph grammars,dge is connected to some event nodes, some of which are considered to be predecessors of the edge, whereas others are successor nodes. This induces a partial ordering of the hyperedges. Some aspects of the Ada rendezvous are used as an example and translated into hypergraph productions.作者: Coordinate 時間: 2025-3-28 19:25
A parser for context free plex grammars,Our parser is able to recognize not only complete structures generated by a plex grammar but also partial ones. The algorithm has been implemented and tested on a number of examples. The time complexity of the parser is exponential in general, but there exist subclasses of plex languages for which the parser has a polynomial time complexity.作者: 煩躁的女人 時間: 2025-3-29 00:16 作者: fructose 時間: 2025-3-29 04:21 作者: 暖昧關系 時間: 2025-3-29 09:57 作者: 傲慢人 時間: 2025-3-29 13:49
https://doi.org/10.1007/978-3-031-43304-7dge is connected to some event nodes, some of which are considered to be predecessors of the edge, whereas others are successor nodes. This induces a partial ordering of the hyperedges. Some aspects of the Ada rendezvous are used as an example and translated into hypergraph productions.作者: MIRTH 時間: 2025-3-29 17:24 作者: delegate 時間: 2025-3-29 21:31 作者: Abutment 時間: 2025-3-30 00:12
https://doi.org/10.1007/978-3-031-31104-8. · (|.| + |.|log|.|)), respectively, where |.| is the number of edges in the given graph, |.| is the number of vertices, and . is the number of groups. The latter algorithm propagates a set of wavefronts with different distances simultaneously through the graph; it is interesting in its own right.作者: 放牧 時間: 2025-3-30 05:30
,Beyond Steiner’s problem: A VLSI oriented generalization,. · (|.| + |.|log|.|)), respectively, where |.| is the number of edges in the given graph, |.| is the number of vertices, and . is the number of groups. The latter algorithm propagates a set of wavefronts with different distances simultaneously through the graph; it is interesting in its own right.作者: Distribution 時間: 2025-3-30 08:32
H. F. Linskens,M. V. Tracey,F. W. Zillikenstruct bounded degree graphs in which the time to complete the broadcast from any node is of the same order as the lower bound. We also obtain the only known families of graphs having exactly minimum broadcast time.作者: 六個才偏離 時間: 2025-3-30 14:31
https://doi.org/10.1007/978-1-4684-1923-8tory in a spatial data structure. The analysis of the expected storage utilization and the expected external height proves the efficiency of the new data structure derived from the application of the PPbin tree principle.作者: 單調(diào)女 時間: 2025-3-30 16:59
Time bounds for broadcasting in bounded degree graphs,struct bounded degree graphs in which the time to complete the broadcast from any node is of the same order as the lower bound. We also obtain the only known families of graphs having exactly minimum broadcast time.作者: Parameter 時間: 2025-3-30 23:22 作者: 小木槌 時間: 2025-3-31 02:54
John F. Reinisch,Youssef Tahiri grammars. This does not hold if the vertex labelling is taken into account. Vice versa hyperedge replacement grammars generate the same languages of simple graphs as . grammars of bounded nonterminal degree. Furthermore the generation of loops and multiple edges by hyperedege replacement grammars is discussed.作者: BET 時間: 2025-3-31 06:02
https://doi.org/10.1007/978-3-7091-3721-5lgorithms from classical graph theory, and for algorithms implemented on networks of communicating processors and distributed systems. Moreover, this theory gives an algebraic model which allows us to mathematically prove properties of distributed algorithms.作者: rectum 時間: 2025-3-31 11:39
https://doi.org/10.1007/978-3-319-22404-6ame transitive closure as . but itself not contains a proper subgraph .. with the same property too. The algorithm uses depth-first search and two graph transformations preserving the transitive closure to achieve a time bound of .(. + .), where . stands for the number of vertices and . is the number of the edges.作者: 逃避現(xiàn)實 時間: 2025-3-31 15:03
On hyperedge replacement and BNLC graph grammars, grammars. This does not hold if the vertex labelling is taken into account. Vice versa hyperedge replacement grammars generate the same languages of simple graphs as . grammars of bounded nonterminal degree. Furthermore the generation of loops and multiple edges by hyperedege replacement grammars is discussed.作者: NUL 時間: 2025-3-31 18:54
Graph rewriting systems with priorities,lgorithms from classical graph theory, and for algorithms implemented on networks of communicating processors and distributed systems. Moreover, this theory gives an algebraic model which allows us to mathematically prove properties of distributed algorithms.作者: Latency 時間: 2025-3-31 22:29
Finding a minimal transitive reduction in a strongly connected digraph within linear time,ame transitive closure as . but itself not contains a proper subgraph .. with the same property too. The algorithm uses depth-first search and two graph transformations preserving the transitive closure to achieve a time bound of .(. + .), where . stands for the number of vertices and . is the number of the edges.作者: Alcove 時間: 2025-4-1 03:21 作者: labyrinth 時間: 2025-4-1 07:04
https://doi.org/10.1007/978-1-349-15603-0A classical PMC multiprocessor system [1] composed of . units is said to be .-.作者: 勉強 時間: 2025-4-1 13:09 作者: 使增至最大 時間: 2025-4-1 14:48
https://doi.org/10.1007/978-981-97-1619-7A subset FcV of vertices of a digraph G=(V,A) with n vertices and m arcs, is called a feedback vertex set (fvs), if G-F is an acyclic digraph (dag). The main results in this paper are:作者: Gratulate 時間: 2025-4-1 20:05
-Diagnosable systems: A characterization and diagnosis algorithm,A classical PMC multiprocessor system [1] composed of . units is said to be .-.作者: 地牢 時間: 2025-4-1 23:34
Bounds to the page number of partially ordered sets,In this paper we initiate study of a new poset invariant, . well-known for graphs. Lower and upper bounds are derived and then they are used to evaluate and to bound the exact value of the page number for some families of posets. Several problems are posed.
