Titlebook: ;

显示全部楼层 · 发表于 2025-3-21 16:40:22

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

显示全部楼层 · 发表于 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.

显示全部楼层 · 发表于 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

显示全部楼层 · 发表于 2025-3-22 14:55:07

显示全部楼层 · 发表于 2025-3-22 21:04:43

显示全部楼层 · 发表于 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.

显示全部楼层 · 发表于 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.

显示全部楼层 · 发表于 2025-3-23 08:22:06

		自动登录	找回密码
密码			To register

关于派博传思			派博传思旗下网站			友情链接
派博传思介绍	公司地理位置	论文服务流程	影响因子官网	SITEMAP	大讲堂	北京大学	Oxford Uni.	Harvard Uni.
发展历史沿革	期刊点评	投稿经验总结	SCIENCEGARD	IMPACTFACTOR	派博系数	清华大学	Yale Uni.	Stanford Uni.
\|Archiver\|手机版\|小黑屋\| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-8 01:03
Copyright © 2001-2015 派博传思京公网安备110108008328 版权所有 All rights reserved

Titlebook: ;

浏览过的版块