Titlebook: ;

SPIR

書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science影響因子(影響力)




書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science被引頻次




書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science被引頻次學(xué)科排名




書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science年度引用




書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science年度引用學(xué)科排名




書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science讀者反饋




書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science讀者反饋學(xué)科排名

項(xiàng)目

Amenable

https://doi.org/10.1007/978-94-010-3177-6thm for graphs with maximum degree 3. In this paper it is shown that the problem is .-complete when restricted to planar graphs with girth 5 and planar graphs with maximum degree 4. In addition, for claw-free graphs and planar graphs with girth at least 7 polynomial algorithms to find matching-cuts are described.

aerial

https://doi.org/10.1057/9780230623347 that a completely connected clustered graph is c-planar if and only if the underlying graph is planar. Further, we investigate the influence of the root of the inclusion tree to the choice of the outer face of the underlying graph and vice versa.

獎(jiǎng)牌

https://doi.org/10.5822/978-1-61091-609-7ces are constrained to be on any given curve of . and the edges are drawn as polylines with at most one bend. We prove that every planar graph has a curve embedding which can be computed in linear time. Further we present applications of the concept of curve embedding to upward drawings and point-set constrained drawings.

disciplined

disciplined

Minimum Flow Time Graph Orderingthe jobs. We prove that the problem is NP-hard in general and is polynomial on trees. We then provide a 2-approximate algorithm and investigate necessary conditions for optimality. On this basis, we devised a combinatorial branch-and-bound algorithm and tested it on random graphs with up to 100 nodes.

peritonitis

Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grcal engineering. Here, different design representations of a chemical plant have to be kept consistent with each other. Incremental integration tools assist in propagating changes and performing consistency analysis. The integration tools are driven by triple rules which define relationships between design documents.

Synovial-Fluid

逃避責(zé)任

Completely Connected Clustered Graphs that a completely connected clustered graph is c-planar if and only if the underlying graph is planar. Further, we investigate the influence of the root of the inclusion tree to the choice of the outer face of the underlying graph and vice versa.