找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: ;

[復(fù)制鏈接]
樓主: Corticosteroids
31#
發(fā)表于 2025-3-27 00:29:50 | 只看該作者
32#
發(fā)表于 2025-3-27 02:58:05 | 只看該作者
Algorithms and Models for the On-Line Vertex-Covering,the final solution dealing with this step. We first study the minimum vertex-covering problem under two on-line models corresponding to two different ways vertices are revealed. The former one implies that the input-graph is revealed vertex-by-vertex. The second model implies that the input-graph is
33#
發(fā)表于 2025-3-27 08:03:27 | 只看該作者
Weighted Node Coloring: When Stable Sets Are Expensive, of a stable set . of . is .(.) = max.(υ) : υ ∈ . ∩ .. A .-coloring . = (. ., . . . , . .) of . is a partition of . into . stable sets . ., . . . , . . and the weight of . is .(. .) + . . . + .(. .). The objective then is to find a coloring . = (. ., . . . , . .) of . such that .(. .) + . . . + .(.
34#
發(fā)表于 2025-3-27 11:07:15 | 只看該作者
The Complexity of Restrictive ,-Coloring,ider the decision and the counting version of the problem; namely the . . and the . #. problems. We provide a dichotomy theorem characterizing the .‘s for which the restrictive .-coloring problem is either NP-complete or polynomially solvable. Moreover, we prove that the same criterion discriminates
35#
發(fā)表于 2025-3-27 13:49:31 | 只看該作者
An Additive Stretched Routing Scheme for Chordal Graphs,imum clique size ., a routing scheme using routing tables of .(. log .) bits per node and .(log .) bit addresses such that the length of the route between any two nodes is at most the distance between the nodes in the graph plus two. This is complemented by a recent lower bound that shows that if th
36#
發(fā)表于 2025-3-27 20:00:11 | 只看該作者
37#
發(fā)表于 2025-3-28 00:26:56 | 只看該作者
38#
發(fā)表于 2025-3-28 04:53:29 | 只看該作者
39#
發(fā)表于 2025-3-28 07:11:02 | 只看該作者
The Complexity of Approximating the Oriented Diameter of Chordal Graphs,orithmic aspects of determining the oriented diameter of a chordal graph. We — give a linear time algorithm such that, for a given chordal graph ., either concludes that there is no strongly connected orientation of ., or finds a strongly connected orientation of . with diameter at most twice the di
40#
發(fā)表于 2025-3-28 13:10:46 | 只看該作者
 關(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.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-6 05:17
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
宁海县| 桂平市| 泾源县| 武冈市| 太仓市| 彩票| 岑溪市| 云浮市| 广丰县| 延川县| 洛阳市| 昆明市| 共和县| 新野县| 娄烦县| 革吉县| 勐海县| 德阳市| 扶沟县| 永仁县| 琼海市| 桑日县| 葫芦岛市| 兰考县| 闽清县| 仙游县| 长白| 武功县| 曲靖市| 长葛市| 宝应县| 镶黄旗| 唐海县| 江城| 宁远县| 东兴市| 新宾| 夹江县| 黄龙县| 南阳市| 沁源县|