螺丝刀
发表于 2025-3-21 16:40:22
书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0388023<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0388023<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0388023<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0388023<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0388023<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0388023<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0388023<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0388023<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0388023<br><br> <br><br>书目名称Graph-Theoretic Concepts in Computer Science读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0388023<br><br> <br><br>
脊椎动物
发表于 2025-3-21 23:59:10
https://doi.org/10.1007/978-3-658-25617-3Pullback rewriting has recently been introduced as a new and unifying paradigm for vertex rewriting in graphs. In this paper we show how to extend it to describe in a uniform way more rewriting mechanisms such as node and handle rewriting in hypergraphs.
Halfhearted
发表于 2025-3-22 04:09:10
Andriy Luntovskyy,Dietbert GütterLet an edge cut partition the vertex set of the .-cube into . subsets ..,..., .. with ∥..¦ — ¦A.∥ ⩽ 1. We consider the problem to determine minimal size of such a cut and present its asymptotic as . → ∞ and also as . → ∞ and . is a constant of the form .=2.±. with .≥.≥0.
不连贯
发表于 2025-3-22 04:59:08
Moderne Rechnernetze – ÜbungsbuchIn the paper we prove that, for a fixed ., the problem of deciding whether a graph admits a partition of its vertex set into .-element cliques or anticliques (i.e. independent sets) is polynomial.
不能约
发表于 2025-3-22 11:19:06
http://reply.papertrans.cn/39/3881/388023/388023_5.png
Abjure
发表于 2025-3-22 14:55:07
http://reply.papertrans.cn/39/3881/388023/388023_6.png
Abjure
发表于 2025-3-22 21:04:43
http://reply.papertrans.cn/39/3881/388023/388023_7.png
IST
发表于 2025-3-22 23:05:50
,On κ-partitioning the n-cube,Let an edge cut partition the vertex set of the .-cube into . subsets ..,..., .. with ∥..¦ — ¦A.∥ ⩽ 1. We consider the problem to determine minimal size of such a cut and present its asymptotic as . → ∞ and also as . → ∞ and . is a constant of the form .=2.±. with .≥.≥0.
debouch
发表于 2025-3-23 01:56:51
Clique and anticlique partitions of graphs,In the paper we prove that, for a fixed ., the problem of deciding whether a graph admits a partition of its vertex set into .-element cliques or anticliques (i.e. independent sets) is polynomial.
TRUST
发表于 2025-3-23 08:22:06
http://reply.papertrans.cn/39/3881/388023/388023_10.png