Titlebook: ;

arouse

书目名称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读者反馈学科排名

Insul岛

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

apiary

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

胰脏

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.

胰脏

烦人

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).

含糊

ABYSS

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).