Titlebook: ;

高出来的名词

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

不能约

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

透明

责任

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.

责任

相反放置

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.