書目名稱Graphtheoretic Concepts in Computer Science影響因子(影響力)學(xué)科排名
書目名稱Graphtheoretic Concepts in Computer Science網(wǎng)絡(luò)公開度
書目名稱Graphtheoretic Concepts in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graphtheoretic Concepts in Computer Science被引頻次
書目名稱Graphtheoretic Concepts in Computer Science被引頻次學(xué)科排名
書目名稱Graphtheoretic Concepts in Computer Science年度引用
書目名稱Graphtheoretic Concepts in Computer Science年度引用學(xué)科排名
書目名稱Graphtheoretic Concepts in Computer Science讀者反饋
書目名稱Graphtheoretic Concepts in Computer Science讀者反饋學(xué)科排名
作者: 性冷淡 時(shí)間: 2025-3-21 21:57 作者: JUST 時(shí)間: 2025-3-22 01:23
https://doi.org/10.1007/978-3-658-35136-6elled graphs. The equivalence of this concept to the graph-specification model Culik II and Maurer [2] developed to describe so called selector-graphs in a linear way is shown. Further, two constructions which modify weakly non-linearizable graphs such that their modification are linearizable are gi作者: ALTER 時(shí)間: 2025-3-22 05:19 作者: cluster 時(shí)間: 2025-3-22 08:45 作者: synovium 時(shí)間: 2025-3-22 14:46
https://doi.org/10.1007/978-3-663-07311-6spanning subtrees of graphs, may be reconstructed on need, for example to enable a LR-like syntactic analysis of graph-languages. In this paper, the properties of derivations and the ambiguity of such ordered graph grammars are discussed.作者: synovium 時(shí)間: 2025-3-22 18:52 作者: TOXIN 時(shí)間: 2025-3-22 23:07
https://doi.org/10.1007/978-3-663-02709-6We analyse the worst case cost of sequences of insertions and deletions in weak B-trees. This leads to a new data structure (level-linked weak B-trees) for representing sorted lists when the access pattern exhibits a (time-varying) locality of reference. Our structure is substantially simpler than t作者: GOAT 時(shí)間: 2025-3-23 02:27
https://doi.org/10.1007/978-3-322-87711-6digraphs. The classes at the lowest level of the hierarchy have a polynomially solvable isomorphism problem, whereas the more general ones have an isomorphism complete one. For all classes we develop graph grammars and examine them for properties reflecting the complexity of the corresponding isomor作者: cloture 時(shí)間: 2025-3-23 06:01
https://doi.org/10.1007/978-3-322-85973-0vely irreducible kernels in graphs. This idea, in particular properties of trans. irr. kernels of full families of functional dependencies (FDs) are investigated. It is shown that such kernels have some kind of coset structure which allows to restrict the investigations to the so-called main classes作者: coddle 時(shí)間: 2025-3-23 10:24
https://doi.org/10.1007/978-3-322-87592-1ects, namely arbitrary directed rooted graphs in which the information associated with each node is either empty, elementary or an object in the general class. Since many data structures cannot be modelled by tree structures in a natural way, such a generalisation to graphs is desirable. Furthermore作者: 過去分詞 時(shí)間: 2025-3-23 15:06 作者: Cerebrovascular 時(shí)間: 2025-3-23 20:50
The post-office problem and related questions,d by straightline segments a simple algorithm was given recently which is optimal (up to constants). For the case of regions bounded by more or less arbitrary curves no optimal algorithm is known to date. We present a simple (non-optimal) algorithm and demonstrate that space-optimal solutions are po作者: capillaries 時(shí)間: 2025-3-24 00:03 作者: 為寵愛 時(shí)間: 2025-3-24 03:00
On linearizing graphs,elled graphs. The equivalence of this concept to the graph-specification model Culik II and Maurer [2] developed to describe so called selector-graphs in a linear way is shown. Further, two constructions which modify weakly non-linearizable graphs such that their modification are linearizable are gi作者: 責(zé)任 時(shí)間: 2025-3-24 08:07
Set-theoretic concepts in programming languages and their implementation,s of the language constructs as well as in the efficiency of implementation. Then, we combine these concepts to new language constructs and propose an efficient implementation using associative array processors.作者: 壓倒 時(shí)間: 2025-3-24 13:05 作者: 腐敗 時(shí)間: 2025-3-24 18:23 作者: 同步左右 時(shí)間: 2025-3-24 19:59
The power of a one-dimensional vector of processors,and supported these principles by displaying a number of particular algorithms based on various "communication geometries". In this paper we will examine a communication geometry which Kung calls the "one-dimensional array of processors", and which we call a "processor vector" or "PV". We will see t作者: Morose 時(shí)間: 2025-3-25 02:53 作者: 壯觀的游行 時(shí)間: 2025-3-25 06:01 作者: 緯線 時(shí)間: 2025-3-25 10:37
The use of transitively irreducible kernels of full families of functional dependencies in logical vely irreducible kernels in graphs. This idea, in particular properties of trans. irr. kernels of full families of functional dependencies (FDs) are investigated. It is shown that such kernels have some kind of coset structure which allows to restrict the investigations to the so-called main classes作者: Reverie 時(shí)間: 2025-3-25 12:22 作者: 幾何學(xué)家 時(shí)間: 2025-3-25 18:50 作者: spondylosis 時(shí)間: 2025-3-25 22:19 作者: bromide 時(shí)間: 2025-3-26 01:33
https://doi.org/10.1007/978-3-322-85973-0The max. and minimal elements of the main classes contain all important information on the full families of FDs. The result can be employed as a common framework for algorithms essential in logical data base design.作者: 消散 時(shí)間: 2025-3-26 08:05 作者: 我邪惡 時(shí)間: 2025-3-26 08:37 作者: 巧思 時(shí)間: 2025-3-26 13:02
Graph rewriting and automatic, machine-independent program optimization, graph-like intermediate code in which all structural information of the source code is still present. Optimization is then carried out by graph manipulations. This is sketched by some examples, namely local common subexpression elimination, motion of loop invariant computations, and induction variable elimination.作者: 顛簸地移動(dòng) 時(shí)間: 2025-3-26 18:25
The power of a one-dimensional vector of processors,ine a communication geometry which Kung calls the "one-dimensional array of processors", and which we call a "processor vector" or "PV". We will see that this simple structure can efficiently solve the rather difficult problems of multiplying matrices and of constructing minimum spanning trees.作者: 勤勞 時(shí)間: 2025-3-27 00:36
A framework for data structures,al class. Since many data structures cannot be modelled by tree structures in a natural way, such a generalisation to graphs is desirable. Furthermore, the concept of hierarchy in which a node may serve for an arbitrary complex substructure supports a structured view of complex data objects.作者: 消息靈通 時(shí)間: 2025-3-27 01:27
An observation concerning the complexity of problems with few solutions and its application to crypds to a ‘yes’ answer — then A is not NP-hard. We apply this result to Cryptography, and show that if our new hypothesis is true then a well designed cryptosystem, whose cracking problem is NP-hard, contains a large subproblem which is not NP-hard.作者: 功多汁水 時(shí)間: 2025-3-27 07:10
https://doi.org/10.1007/978-3-322-87685-0iving many examples. Decision problems and closure properties under graph operations are also discussed. Among others it is shown that whether two rational machines generate the same series of graphs is undecidable.作者: CAPE 時(shí)間: 2025-3-27 09:33
https://doi.org/10.1007/978-3-663-02709-6he one proposed by Guibas, McCreight, Plass and Roberts, yet it has many of its properties. Our structure is as simple as the one proposed by Brown/Tarjan, but our structure can treat arbitrary sequences of insertions and deletions whilst theirs can only treat non-interacting insertions and deletions.作者: Wordlist 時(shí)間: 2025-3-27 14:15
Series of graphs generated by rational machines,iving many examples. Decision problems and closure properties under graph operations are also discussed. Among others it is shown that whether two rational machines generate the same series of graphs is undecidable.作者: 珊瑚 時(shí)間: 2025-3-27 20:09 作者: aviator 時(shí)間: 2025-3-27 22:49
https://doi.org/10.1007/978-3-322-87585-3 graph-like intermediate code in which all structural information of the source code is still present. Optimization is then carried out by graph manipulations. This is sketched by some examples, namely local common subexpression elimination, motion of loop invariant computations, and induction variable elimination.作者: Adj異類的 時(shí)間: 2025-3-28 04:55
M?glichkeiten und Grenzen der Medizinine a communication geometry which Kung calls the "one-dimensional array of processors", and which we call a "processor vector" or "PV". We will see that this simple structure can efficiently solve the rather difficult problems of multiplying matrices and of constructing minimum spanning trees.作者: 顛簸下上 時(shí)間: 2025-3-28 08:20
https://doi.org/10.1007/978-3-322-87592-1al class. Since many data structures cannot be modelled by tree structures in a natural way, such a generalisation to graphs is desirable. Furthermore, the concept of hierarchy in which a node may serve for an arbitrary complex substructure supports a structured view of complex data objects.作者: Omnipotent 時(shí)間: 2025-3-28 10:52
https://doi.org/10.1007/978-3-322-88533-3ds to a ‘yes’ answer — then A is not NP-hard. We apply this result to Cryptography, and show that if our new hypothesis is true then a well designed cryptosystem, whose cracking problem is NP-hard, contains a large subproblem which is not NP-hard.作者: follicular-unit 時(shí)間: 2025-3-28 14:47 作者: recede 時(shí)間: 2025-3-28 21:38
https://doi.org/10.1007/978-3-663-07310-9d by straightline segments a simple algorithm was given recently which is optimal (up to constants). For the case of regions bounded by more or less arbitrary curves no optimal algorithm is known to date. We present a simple (non-optimal) algorithm and demonstrate that space-optimal solutions are possible.作者: dendrites 時(shí)間: 2025-3-29 02:53
Hans-Ernst Schwiete,Reinhard Vinkeloes of the language constructs as well as in the efficiency of implementation. Then, we combine these concepts to new language constructs and propose an efficient implementation using associative array processors.作者: obsolete 時(shí)間: 2025-3-29 05:06 作者: 支柱 時(shí)間: 2025-3-29 09:05 作者: sulcus 時(shí)間: 2025-3-29 14:11 作者: 小平面 時(shí)間: 2025-3-29 19:32 作者: 不容置疑 時(shí)間: 2025-3-29 21:28 作者: colloquial 時(shí)間: 2025-3-30 00:02 作者: nonplus 時(shí)間: 2025-3-30 06:08
https://doi.org/10.1007/978-3-642-52491-2This paper deals with some almost sure graph properties. A very efficient algorithm is given which yields a sample graph from the uniform distribution on the set of all connected graphs of given size n. An almost surely canonical graph labelling and an algorithm which tries to find a Hamiltonian cycle in a given graph are discussed.作者: 含水層 時(shí)間: 2025-3-30 12:07 作者: magenta 時(shí)間: 2025-3-30 13:24
https://doi.org/10.1007/978-3-663-04926-5We discuss a number of problem areas that are basic to any computation-motivated study of graph embeddings and their costs; and we illustrate each topic with one or two recent results in that area. Included among the discussed areas are: similarity of families of graphs, generic families of graphs, and tradeoffs among the costs of an embedding.作者: 審問 時(shí)間: 2025-3-30 20:36
https://doi.org/10.1007/978-3-663-04531-1The combinatorial analysis of the behaviour of various classes of data structures is increasingly becoming amenable to investigation as new techniques are developed. In this paper we survey the results available for search trees with an emphasis on post-Yao results.作者: garrulous 時(shí)間: 2025-3-30 22:06 作者: Angioplasty 時(shí)間: 2025-3-31 04:01 作者: 厚臉皮 時(shí)間: 2025-3-31 06:52 作者: 傾聽 時(shí)間: 2025-3-31 13:14 作者: collagenase 時(shí)間: 2025-3-31 15:00
Graphtheoretic Concepts in Computer Science978-3-540-38435-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Missile 時(shí)間: 2025-3-31 21:02 作者: curettage 時(shí)間: 2025-3-31 22:35
Nationale und internationale Zusammenarbeitkein geringerer als . (1932) dieses Problem aktualisierte. Wie ich in meiner ersten Darstellung in diesem Handbuch (S. 73) berichten konnte, hatte mir der bekannte Muskelhistologe 1929 in einem Brief mitgeteilt, da? er seit mindestens 15 Jahren die Segmente, in welche dieses Muskelgewebe durch ?Scha作者: linguistics 時(shí)間: 2025-4-1 02:52 作者: Fibrin 時(shí)間: 2025-4-1 07:10
Jason S. Lee*,Hee June Choi*,Sung Hee BaekBlock VI. Boden: Diluvialsand, z. L. schwach lehmig, Lehm sehr tiefliegend und nur im N. erreicht. Kiefer II. u. II./III. 95 ha. Durchschnittliche Schlaggr??e 9,5 ha. Bestand: Kiefer mit Buche.