Titlebook: ;

高出來(lái)的名詞

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




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




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




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




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




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




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




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




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




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

不能約

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.

GIBE

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.

Anhydrous

透明

責(zé)任

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.

責(zé)任

相反放置

PHON

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

diabetes

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.