amateur
发表于 2025-3-21 18:14:39
书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0388018<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0388018<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0388018<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0388018<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0388018<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0388018<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0388018<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0388018<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0388018<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0388018<br><br> <br><br>
vibrant
发表于 2025-3-21 20:23:09
http://reply.papertrans.cn/39/3881/388018/388018_2.png
Pcos971
发表于 2025-3-22 02:41:32
Computing the Tutte Polynomial on Graphs of Bounded Clique-Widththan that of tree-width. We show a subexponential algorithm (running in time exp.(..)) for computing the Tutte polynomial on cographs. The algorithm can be extended to a subexponential algorithm computing the Tutte polynomial on on all graphs of bounded clique-width. In fact, our algorithm computes the more general .-polynomial... 05C85, 68R10.
voluble
发表于 2025-3-22 06:23:15
http://reply.papertrans.cn/39/3881/388018/388018_4.png
dragon
发表于 2025-3-22 10:02:09
Fang Zhi-yang,Sheng Zhi-yong,Ge Sheng-ded into each other by a sequence of triangle mutations – or triangle switches. This construction generalizes Ringel’s theorem on uniform pseudoline arrangements. Moreover, it applies to plane projections of spatial graphs encoded by rank 4 uniform oriented matroids.
nepotism
发表于 2025-3-22 14:16:25
Modern Trends in Fuzzy Graph Theoryt be .-hard. In this paper, we show that optimal broadcast domination is actually in ., and we give a polynomial time algorithm for solving the problem on arbitrary graphs, using a non standard approach.
nepotism
发表于 2025-3-22 19:00:59
Complete Graph Drawings Up to Triangle Mutationsd into each other by a sequence of triangle mutations – or triangle switches. This construction generalizes Ringel’s theorem on uniform pseudoline arrangements. Moreover, it applies to plane projections of spatial graphs encoded by rank 4 uniform oriented matroids.
漂亮
发表于 2025-3-22 22:30:28
http://reply.papertrans.cn/39/3881/388018/388018_8.png
怪物
发表于 2025-3-23 03:31:04
http://reply.papertrans.cn/39/3881/388018/388018_9.png
ADJ
发表于 2025-3-23 08:58:50
http://reply.papertrans.cn/39/3881/388018/388018_10.png