Titlebook: ;

二足動(dòng)物

書目名稱Graphtheoretic Concepts in Computer Science影響因子(影響力)




書目名稱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é)科排名

性冷淡

JUST

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

cluster

synovium

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

TOXIN

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

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

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