Titlebook: ;

只看該作者 · 發(fā)表于 2025-3-30 15:01:08

Turning Cliques into Paths to Achieve Planarityet is a path, in such a way that the resulting subgraph of . is planar. We study this problem when . is a simple topological graph, and establish its complexity in relation to .-planarity. We prove that . . is NP-complete even when . and . is a simple 3-plane graph, while it can be solved in linear time, for any ., when . is 1-plane.

		自動(dòng)登錄	找回密碼
密碼			To register

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