Titlebook: ;

代表

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

排名真古怪

Ventricle

Markus Mangiapane,Roman P. Büchlerstructural properties of the class, we propose a .(...)-time algorithm, improving Johansson’s algorithm [14]. Moreover, our alogrithm is simple to understand. The above properties and algorithm allow us to propose a robust .(...)-time isomorphism algorithm for NLC-2 graphs. As far as we know, it is the first polynomial-time algorithm.

你敢命令

https://doi.org/10.1007/978-3-642-36132-6ight independent set problem (selecting a set of disjoint disks in the plane of maximum total weight) in disk graphs and for the maximum bisection problem (finding a partition of the vertex set into two subsets of equal cardinality with maximum number of edges between the subsets) in unit-disk graphs.

非秘密

Stress-Fracture

NLC-2 Graph Recognition and Isomorphism,structural properties of the class, we propose a .(...)-time algorithm, improving Johansson’s algorithm [14]. Moreover, our alogrithm is simple to understand. The above properties and algorithm allow us to propose a robust .(...)-time isomorphism algorithm for NLC-2 graphs. As far as we know, it is the first polynomial-time algorithm.

Stress-Fracture

Approximation Algorithms for Geometric Intersection Graphs,ight independent set problem (selecting a set of disjoint disks in the plane of maximum total weight) in disk graphs and for the maximum bisection problem (finding a partition of the vertex set into two subsets of equal cardinality with maximum number of edges between the subsets) in unit-disk graphs.

故意

https://doi.org/10.1007/978-3-663-10832-0A linear-time algorithm that does not need a planar embedding is presented for the problem of computing two vertex-disjoint paths, each with prescribed endpoints, in an undirected 3-connected planar graph.

撕裂皮肉

刪除