arouse
发表于 2025-3-21 18:41:48
书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0388028<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0388028<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0388028<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0388028<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0388028<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0388028<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0388028<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0388028<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0388028<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0388028<br><br> <br><br>
Insul岛
发表于 2025-3-21 22:08:29
Modernisierung der Berufsbildung in Europaubgraph in an edge-weighted graph . on . nodes. We present an .(..)-algorithm for the weak subgraph problem. If the maximal degree of . is bounded, the algorithm above can be modified to an .(..)-algorithm for the induced subgraph problem.
Recessive
发表于 2025-3-22 01:07:27
http://reply.papertrans.cn/39/3881/388028/388028_3.png
apiary
发表于 2025-3-22 04:43:43
https://doi.org/10.1057/9781137393753er of other processors (.). A message-routing paradigm for such a multidestination communication has been formulated as finding a subgraph called an . (ODPT). We prove that the problem of finding an ODPT is NP-hard both for the .-cube graph as well as for a graph whose maximum degree is at most three.
Deceit
发表于 2025-3-22 09:02:31
http://reply.papertrans.cn/39/3881/388028/388028_5.png
胰脏
发表于 2025-3-22 16:09:35
Two polynomial problems in PLA folding,e-folding problems are known to be NP-hard. We define the compatibility graph of a PLA as the complement of its column-disjoint graph, and prove that both block-folding and variable-folding can be solved in polynomial time on PLA whose compatibility graph does not contain a claw or a (K. − e) as induced subgraph.
胰脏
发表于 2025-3-22 17:14:28
http://reply.papertrans.cn/39/3881/388028/388028_7.png
烦人
发表于 2025-3-22 23:13:37
Modernisierung des Öffentlichen DienstesWe prove by a reduction from 3SAT that the INDUCED SUBGRAPH ISOMORPHISM problem remains NP-complete when restricted to cographs (P.-free graphs).
含糊
发表于 2025-3-23 03:11:48
http://reply.papertrans.cn/39/3881/388028/388028_9.png
ABYSS
发表于 2025-3-23 08:59:10
Induced subraph isomorphism for cographs is NP-complete,We prove by a reduction from 3SAT that the INDUCED SUBGRAPH ISOMORPHISM problem remains NP-complete when restricted to cographs (P.-free graphs).