高出来的名词
发表于 2025-3-21 18:05:13
书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0388037<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0388037<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0388037<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0388037<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0388037<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0388037<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0388037<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0388037<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0388037<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0388037<br><br> <br><br>
不能约
发表于 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.
GIBE
发表于 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.
Anhydrous
发表于 2025-3-22 07:16:11
http://reply.papertrans.cn/39/3881/388037/388037_4.png
透明
发表于 2025-3-22 10:05:57
http://reply.papertrans.cn/39/3881/388037/388037_5.png
责任
发表于 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.
责任
发表于 2025-3-22 18:09:06
http://reply.papertrans.cn/39/3881/388037/388037_7.png
相反放置
发表于 2025-3-23 00:59:33
http://reply.papertrans.cn/39/3881/388037/388037_8.png
PHON
发表于 2025-3-23 02:42:53
Graph-Theoretic Concepts in Computer Science978-3-540-46735-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
diabetes
发表于 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.