Titlebook: ;

只看該作者 · 發(fā)表于 2025-3-21 16:40:22

書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)

書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學(xué)科排名

書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度

書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名

書目名稱Graph-Theoretic Concepts in Computer Science被引頻次

書目名稱Graph-Theoretic Concepts in Computer Science被引頻次學(xué)科排名

書目名稱Graph-Theoretic Concepts in Computer Science年度引用

書目名稱Graph-Theoretic Concepts in Computer Science年度引用學(xué)科排名

書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋

書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學(xué)科排名

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 2025-3-22 11:19:06

只看該作者 · 發(fā)表于 2025-3-22 14:55:07

只看該作者 · 發(fā)表于 2025-3-22 21:04:43

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 2025-3-23 08:22:06

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-5 09:29
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved