Titlebook: ;

DEIFY

书目名称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被引频次学科排名




书目名称Graph-Theoretic Concepts in Computer Science年度引用




书目名称Graph-Theoretic Concepts in Computer Science年度引用学科排名




书目名称Graph-Theoretic Concepts in Computer Science读者反馈




书目名称Graph-Theoretic Concepts in Computer Science读者反馈学科排名

马具

https://doi.org/10.1007/978-3-662-28402-5cutively in a walk in the graph. In this paper, we look for the smallest set of transitions needed to be able to go from any vertex of the given graph to any other. We prove that this problem is NP-hard and study approximation algorithms. We develop theoretical tools that help to study this problem.

JAMB

Moderne Chirurgie des Rektumkarzinomsoblem cannot be solved in time . on general directed graphs, where . is the treewidth of the underlying undirected graph. This is matched by a dynamic programming algorithm with running time .. On the other hand, we show that if the input digraph is planar, then the running time can be improved to ..

hemophilia

https://doi.org/10.1007/978-3-531-91829-7s note, we show that there are planar graphs of pathwidth 3 with arbitrarily large anagram-free chromatic number. More specifically, we describe 2.-vertex planar graphs of pathwidth 3 with anagram-free chromatic number .. We also describe . vertex graphs with pathwidth . having anagram-free chromatic number in ..

蹒跚

On Minimum Connecting Transition Sets in Graphs,cutively in a walk in the graph. In this paper, we look for the smallest set of transitions needed to be able to go from any vertex of the given graph to any other. We prove that this problem is NP-hard and study approximation algorithms. We develop theoretical tools that help to study this problem.

蕨类

蕨类

青少年

On Dispersable Book Embeddings,such that: (i) no two edges of the same page cross, and (ii) no two edges of the same page share a common endvertex. The minimum number of pages needed in a dispersable book embedding of . is called its ., .(.). Graph . is called . if . equals the maximum degree of ., . (note that . always holds)..B

不规则

Ptosis