Titlebook: ;

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

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

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

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

書(shū)目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開(kāi)度學(xué)科排名

書(shū)目名稱Graph-Theoretic Concepts in Computer Science被引頻次

書(shū)目名稱Graph-Theoretic Concepts in Computer Science被引頻次學(xué)科排名

書(shū)目名稱Graph-Theoretic Concepts in Computer Science年度引用

書(shū)目名稱Graph-Theoretic Concepts in Computer Science年度引用學(xué)科排名

書(shū)目名稱Graph-Theoretic Concepts in Computer Science讀者反饋

書(shū)目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學(xué)科排名

只看該作者 · 發(fā)表于 2025-3-21 21:57:51

https://doi.org/10.1007/978-1-4613-1143-0-element chains (resp. antichains). We show that .., ., is NP-complete even for N-free ordered sets of length at most .. and .. are polynomial for series-paralel orders and .. is polynomial for interval orders. We also consider related problems for graphs.

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

Molecular Biology of Plant Viruseshat the optimal ordering problem can be transformed into the well-known minimum-weight spanning tree problem. Some properties of optimal vertex orderings are investigated. And finally, the application of the optimal vertex ordering technique to an algorithm for detecting the symmetry of polyhedra is discussed in some detail.

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

只看該作者 · 發(fā)表于 2025-3-22 10:05:57

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

On complexity of some chain and antichain partition problems,-element chains (resp. antichains). We show that .., ., is NP-complete even for N-free ordered sets of length at most .. and .. are polynomial for series-paralel orders and .. is polynomial for interval orders. We also consider related problems for graphs.

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

只看該作者 · 發(fā)表于 2025-3-23 00:59:33

只看該作者 · 發(fā)表于 2025-3-23 02:42:53

Graph-Theoretic Concepts in Computer Science978-3-540-46735-9Series ISSN 0302-9743 Series E-ISSN 1611-3349

只看該作者 · 發(fā)表于 2025-3-23 05:54:16

Molecular Biology of Human CancersWe propose a new kind of Graph Rewriting Systems (GRS) that provide a theoretical foundation for using the reduction methods to analyze network reliability, and give the critical pair lemma in this paper.

		自動(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-15 23:50
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved