找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: ;

[復制鏈接]
查看: 21444|回復: 63
樓主
發(fā)表于 2025-3-21 18:14:39 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Graph-Theoretic Concepts in Computer Science
編輯Dieter Kratsch
視頻videohttp://file.papertrans.cn/389/388018/388018.mp4
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: ;
出版日期Conference proceedings 20051st edition
版次1
doihttps://doi.org/10.1007/11604686
isbn_softcover978-3-540-31000-6
isbn_ebook978-3-540-31468-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
The information of publication is updating

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




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




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




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




書目名稱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讀者反饋學科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 20:23:09 | 只看該作者
板凳
發(fā)表于 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.
地板
發(fā)表于 2025-3-22 06:23:15 | 只看該作者
5#
發(fā)表于 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.
6#
發(fā)表于 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.
7#
發(fā)表于 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.
8#
發(fā)表于 2025-3-22 22:30:28 | 只看該作者
9#
發(fā)表于 2025-3-23 03:31:04 | 只看該作者
10#
發(fā)表于 2025-3-23 08:58:50 | 只看該作者
 關于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-10 12:30
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復 返回頂部 返回列表
剑河县| 萨迦县| 河南省| 两当县| 许昌市| 龙江县| 沈阳市| 乌兰察布市| 泸溪县| 本溪| 绍兴市| 屯昌县| 天祝| 婺源县| 察雅县| 睢宁县| 名山县| 曲水县| 大化| 吕梁市| 青岛市| 英德市| 广河县| 容城县| 辽宁省| 南汇区| 治县。| 景洪市| 大港区| 呼玛县| 金乡县| 大邑县| 科尔| 临沧市| 安顺市| 陕西省| 阜康市| 比如县| 南漳县| 林州市| 南安市|