Titlebook: ;

只看該作者 · 發(fā)表于 2025-3-21 18:41:48

書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)

書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學科排名

書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度

書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度學科排名

書目名稱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讀者反饋學科排名

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 2025-3-22 01:07:27

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 2025-3-22 09:02:31

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 2025-3-22 17:14:28

只看該作者 · 發(fā)表于 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).

只看該作者 · 發(fā)表于 2025-3-23 03:11:48

只看該作者 · 發(fā)表于 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).

		自動登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點評	投稿經(jīng)驗總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學	Yale Uni.	Stanford Uni.
\|Archiver\|手機版\|小黑屋\| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-13 10:49
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved