標(biāo)題: Titlebook: ; [打印本頁] 作者: HAND 時(shí)間: 2025-3-21 18:51
書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)
書目名稱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 23:29
Applications of parallel scheduling to perfect graphs,problem for comparability graphs, and the maximum matching problem for co-comparability graphs. These parallel algorithms can also be used to identify permutation graphs and interval graphs, important subclasses of perfect graphs.作者: 使服水土 時(shí)間: 2025-3-22 01:27 作者: bioavailability 時(shí)間: 2025-3-22 07:48 作者: Omnipotent 時(shí)間: 2025-3-22 10:40 作者: relieve 時(shí)間: 2025-3-22 16:48 作者: relieve 時(shí)間: 2025-3-22 18:27 作者: 發(fā)生 時(shí)間: 2025-3-22 21:58
https://doi.org/10.1007/978-1-4471-2152-7ees fairness. Besides discussing the flexibility of our theoretical tools for approaching such general problems we also mention a practical application (resource management in the completely distributed operating system DRAGON SLAYER).作者: 努力趕上 時(shí)間: 2025-3-23 03:28
,A simple implementation of Warshall’s algorithm on a vlsi chip,n many graph theoretic algorithms [3]..In this paper we shall describe a new scheme with full details of the implementation, which is quite simple and suitable for VLSI chip fabrication. We shall also outline how the algorithm can be implemented even without wraparound connections. In both the cases the time taken to solve the problem is O(n).作者: strain 時(shí)間: 2025-3-23 07:56 作者: 繁忙 時(shí)間: 2025-3-23 16:45 作者: AUGUR 時(shí)間: 2025-3-23 20:53
https://doi.org/10.1007/978-3-0348-9189-9t of 1–2 brother trees which together with the lower bound obtained earlier yields the desired range estimation. Furthermore, we obtain that at least 11.6% of the internal nodes of a brother tree of maximal height are unary.作者: GROVE 時(shí)間: 2025-3-23 23:02
ADA concurrency specified by graph grammars,operational semantics specification of ADA, though the work is restricted to the "hard kernel" of concurrency and synchronization..The formal definition gives rise to some considerations concerning the precision of the textual ADA Military Standard, implementation considerations and the adequacy of some language constructs.作者: nephritis 時(shí)間: 2025-3-24 02:53 作者: Brain-Waves 時(shí)間: 2025-3-24 07:39 作者: FLIT 時(shí)間: 2025-3-24 14:39 作者: Trigger-Point 時(shí)間: 2025-3-24 17:17
https://doi.org/10.1007/978-3-030-31601-3 of (k+1)D-k for even D and of (k+1)D-2k+2 for odd D≥3. For directed graphs G, the bounds depend strongly on D: for D=1 and D=2 we derive exact bounds of θ (√k) and of 2k+2, respectively, while for D≥3 the resulting diameter is in general unbounded in terms of k and D.作者: Congruous 時(shí)間: 2025-3-24 19:16 作者: Seizure 時(shí)間: 2025-3-24 23:24
https://doi.org/10.1007/978-3-662-08814-2e being sought. We discuss some of the most important heuristics. None of these heuristics is superior to any other, neither in terms of speed nor in terms of the quality of the approximate solution. We present and analyze a new algorithm outperforming all of these heuristics in both aspects.作者: NEXUS 時(shí)間: 2025-3-25 04:12 作者: athlete’s-foot 時(shí)間: 2025-3-25 09:50
https://doi.org/10.1007/978-981-13-8946-7 graph form called program graph. The state transitions of the interpreter are formally defined by a graph grammar..To cope with concurrency, we introduce a mixed derivation rule, which is an intermediate form between sequential and parallel graph rewriting. It is shown, that these tools basicly cov作者: prostate-gland 時(shí)間: 2025-3-25 13:29 作者: altruism 時(shí)間: 2025-3-25 17:45 作者: Connotation 時(shí)間: 2025-3-25 22:15
https://doi.org/10.1007/978-3-0348-9189-9 of brother trees that are optimal with respect to one of these cost measures is already known, as well as how to construct them in linear time. In this paper we investigate sharp bounds for the range that the node visit cost may take for a given size of the tree. To this end we determine the struct作者: Throttle 時(shí)間: 2025-3-26 03:27 作者: acolyte 時(shí)間: 2025-3-26 06:41 作者: 帶來 時(shí)間: 2025-3-26 11:02
deletes successively vertices of degree less than or equal to two. If the degree of a vertex is two, both neighbors of the vertex are joined by an edge. The algorithm works without splitting the graph into its biconnected components or using bucket sort to give the adjacency lists a special order.作者: 陪審團(tuán) 時(shí)間: 2025-3-26 13:09
Thomas Harriehausen,Dieter Schwarzenauorithm to find transitive orientations of graphs where they exist. Both algorithms together solve the maximum clique problem and the minimum coloring problem for comparability graphs, and the maximum matching problem for co-comparability graphs. These parallel algorithms can also be used to identify作者: START 時(shí)間: 2025-3-26 17:32 作者: 推延 時(shí)間: 2025-3-27 00:02
https://doi.org/10.1007/978-3-030-31601-3h G with diameter D, assuming that the resulting graph is still connected. For undirected graphs G we prove an upper bound of (k+1)D and a lower bound of (k+1)D-k for even D and of (k+1)D-2k+2 for odd D≥3. For directed graphs G, the bounds depend strongly on D: for D=1 and D=2 we derive exact bounds作者: Flat-Feet 時(shí)間: 2025-3-27 02:11 作者: nocturia 時(shí)間: 2025-3-27 05:16 作者: nerve-sparing 時(shí)間: 2025-3-27 12:49
,On approximation algorithms for Steiner’s problem in graphs,e being sought. We discuss some of the most important heuristics. None of these heuristics is superior to any other, neither in terms of speed nor in terms of the quality of the approximate solution. We present and analyze a new algorithm outperforming all of these heuristics in both aspects.作者: 不在灌木叢中 時(shí)間: 2025-3-27 16:21
Specification of error distances for graphs by precedence graph grammars and fast recognition of sianguage, which represents the set of all correct patterns. The task is to identify that correct pattern, that is most similar to the input graph. Similarity is defined by weighted editing operations, yielding an error distance. Computing the minimum error distance even for two graphs only is NP-comp作者: 內(nèi)疚 時(shí)間: 2025-3-27 18:52 作者: hegemony 時(shí)間: 2025-3-28 01:19
An interactive graphical manipulation system for higher objects based on relational algebra,uage using DAGs (directed acyclic graphs) and may be manipulated by graphic interaction. Semantics of the language as well as that of the basic DAG-operations is given in terms of relational algebra. An extended example shows the application of the language.作者: neologism 時(shí)間: 2025-3-28 02:41
Behaviour preserving refinements of Petri nets, transition. For the independent design of host and daughter net those daughter nets are of interest that guarantee that an arbitrary host has the same behaviour as the respective refined net. We characterize these daughter nets, called modules, prove that it is decidable whether a net is a module a作者: Ardent 時(shí)間: 2025-3-28 09:13
The node visit cost of brother trees, of brother trees that are optimal with respect to one of these cost measures is already known, as well as how to construct them in linear time. In this paper we investigate sharp bounds for the range that the node visit cost may take for a given size of the tree. To this end we determine the struct作者: 撫育 時(shí)間: 2025-3-28 14:06 作者: Misgiving 時(shí)間: 2025-3-28 18:27 作者: VAN 時(shí)間: 2025-3-28 21:18 作者: 使無效 時(shí)間: 2025-3-29 01:33 作者: output 時(shí)間: 2025-3-29 05:02 作者: commodity 時(shí)間: 2025-3-29 07:57 作者: genuine 時(shí)間: 2025-3-29 11:52 作者: 奇思怪想 時(shí)間: 2025-3-29 17:28 作者: 越自我 時(shí)間: 2025-3-29 23:47 作者: 現(xiàn)代 時(shí)間: 2025-3-30 01:23
Specification of error distances for graphs by precedence graph grammars and fast recognition of si in O(n.) time, n the number of nodes of the whole input graph. Futhermore the parse tree of the most similar graph is computed, thus providing further processing steps with an efficient hierarchical decomposition.作者: prostatitis 時(shí)間: 2025-3-30 04:58 作者: 支形吊燈 時(shí)間: 2025-3-30 08:49 作者: 變形詞 時(shí)間: 2025-3-30 13:51
https://doi.org/10.1007/978-3-662-08814-2e being sought. We discuss some of the most important heuristics. None of these heuristics is superior to any other, neither in terms of speed nor in terms of the quality of the approximate solution. We present and analyze a new algorithm outperforming all of these heuristics in both aspects.作者: 信徒 時(shí)間: 2025-3-30 18:13 作者: gangrene 時(shí)間: 2025-3-30 20:56
deletes successively vertices of degree less than or equal to two. If the degree of a vertex is two, both neighbors of the vertex are joined by an edge. The algorithm works without splitting the graph into its biconnected components or using bucket sort to give the adjacency lists a special order.作者: 認(rèn)識(shí) 時(shí)間: 2025-3-31 04:01 作者: 啟發(fā) 時(shí)間: 2025-3-31 07:16 作者: 充氣女 時(shí)間: 2025-3-31 11:19
Recognizing outerplanar graphs in linear time, deletes successively vertices of degree less than or equal to two. If the degree of a vertex is two, both neighbors of the vertex are joined by an edge. The algorithm works without splitting the graph into its biconnected components or using bucket sort to give the adjacency lists a special order.作者: abnegate 時(shí)間: 2025-3-31 14:22 作者: Adrenal-Glands 時(shí)間: 2025-3-31 18:17 作者: 無能力 時(shí)間: 2025-3-31 22:36
https://doi.org/10.1007/978-3-322-86866-4The ordered bandwidth problem for finite tight suborders . of IN. with (0,0)?. and hence, in particular, for planar distributive lattices is considered. The following sharp bounds in terms of the width are derived for such orders: 作者: LUT 時(shí)間: 2025-4-1 02:27
https://doi.org/10.1007/978-3-322-93889-3Various molecular graphs i.e. graphs which represent chemical structures are described. A number of graph polynomials which are of interest in chemical applications are pointed out and some of their properties discussed. Emphasis is given to the computational aspects of the theory of these polynomials.作者: pester 時(shí)間: 2025-4-1 08:43
https://doi.org/10.1007/978-1-4615-9759-9We present a complete characterization of the class of graphs that admit a ., where vertices are represented by intervals parallel to the axis of the cylinder so that the edges of the graph correspond to visible intervals. Moreover, we give linear time algorithms for testing the existence of and constructing such a representation.作者: multiply 時(shí)間: 2025-4-1 13:04 作者: FLAG 時(shí)間: 2025-4-1 15:03 作者: 滴注 時(shí)間: 2025-4-1 19:54
Graphs and graph polynomials of interest in chemistry,Various molecular graphs i.e. graphs which represent chemical structures are described. A number of graph polynomials which are of interest in chemical applications are pointed out and some of their properties discussed. Emphasis is given to the computational aspects of the theory of these polynomials.作者: esculent 時(shí)間: 2025-4-2 01:16
Centipede graphs and visibility on a cylinder,We present a complete characterization of the class of graphs that admit a ., where vertices are represented by intervals parallel to the axis of the cylinder so that the edges of the graph correspond to visible intervals. Moreover, we give linear time algorithms for testing the existence of and constructing such a representation.作者: laxative 時(shí)間: 2025-4-2 06:28
Grunds?tze ordnungsm??iger Bilanzierung für die Equitymethode978-3-663-13339-1Series ISSN 0175-7105
