代表
发表于 2025-3-21 19:55:49
书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0388026<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0388026<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0388026<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0388026<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0388026<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0388026<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0388026<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0388026<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0388026<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0388026<br><br> <br><br>
排名真古怪
发表于 2025-3-21 23:59:55
http://reply.papertrans.cn/39/3881/388026/388026_2.png
Ventricle
发表于 2025-3-22 01:01:25
Markus Mangiapane,Roman P. Büchlerstructural properties of the class, we propose a .(...)-time algorithm, improving Johansson’s algorithm . 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.
你敢命令
发表于 2025-3-22 05:53:11
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.
非秘密
发表于 2025-3-22 09:45:31
http://reply.papertrans.cn/39/3881/388026/388026_5.png
Stress-Fracture
发表于 2025-3-22 14:17:48
NLC-2 Graph Recognition and Isomorphism,structural properties of the class, we propose a .(...)-time algorithm, improving Johansson’s algorithm . 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
发表于 2025-3-22 19:21:54
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.
故意
发表于 2025-3-23 00:12:17
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.
撕裂皮肉
发表于 2025-3-23 02:49:05
http://reply.papertrans.cn/39/3881/388026/388026_9.png
删除
发表于 2025-3-23 09:04:13
http://reply.papertrans.cn/39/3881/388026/388026_10.png