找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: LATIN 2000: Theoretical Informatics; 4th Latin American S Gaston H. Gonnet,Alfredo Viola Conference proceedings 2000 Springer-Verlag Berlin

[復(fù)制鏈接]
樓主: CHAFF
21#
發(fā)表于 2025-3-25 05:13:28 | 只看該作者
22#
發(fā)表于 2025-3-25 11:17:13 | 只看該作者
Rank Inequalities for Packing Designs and Sparse Triple Systems to codes with constant weight; 4-sparse partial Steiner triple systems (4-sparse PSTSs) correspond to erasure-resilient codes able to correct all (except for “bad ones”) 4-erasures, which are useful in handling failures in large disk arrays [4,10]. The study of polytopes associated with combinatori
23#
發(fā)表于 2025-3-25 15:00:49 | 只看該作者
The Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Graphs for all such graphs, except a few small cases which we have proved are impossible. The solution method is simple but powerful. The pancyclic problem is intended to showcase the power this method offers to solve a wide range of 2-factorization problems. Indeed, these methods go a long way towards be
24#
發(fā)表于 2025-3-25 18:55:48 | 只看該作者
25#
發(fā)表于 2025-3-25 23:47:33 | 只看該作者
Polynomial Time Recognition of Clique-Width ≤? 3 Graphsique-width (but not the converse). For graphs . of bounded , given the bounded width decomposition of ., every optimization, enumeration or evaluation problem that can be defined by a Monadic Second Order Logic formula using quantifiers on vertices but not on edges, can be solved in polynomial time.
26#
發(fā)表于 2025-3-26 03:46:04 | 只看該作者
On Dart-Free Perfectly Contractile Graphs Extended Abstractngth. A graph is perfectly contractile if every induced subgraph has a sequence of even-pair contractions that leads to a clique. We show that a recent conjecture on the forbidden structures for perfectly contractile graphs is satisfied in the case of dart-free graphs. Our proof yields a polynomial-
27#
發(fā)表于 2025-3-26 06:29:15 | 只看該作者
Edge Colouring Reduced Indifference Graphsraphs, whose vertices can be linearly ordered so that the vertices contained in the same maximal clique are consecutive in this order. Two adjacent vertices are twins if they belong to the same maximal cliques. A graph is reduced if it contains no pair of twin vertices. A graph is overfull if the to
28#
發(fā)表于 2025-3-26 11:51:56 | 只看該作者
29#
發(fā)表于 2025-3-26 14:35:52 | 只看該作者
On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract) based on the sequence of prices for the preceding .? – 1 trading periods. Competitive analysis is based on a worst case perspective and such a perspective is inconsistent with the more widely accepted analyses and theories based on distributional assumptions. The competitive framework does (perhaps
30#
發(fā)表于 2025-3-26 20:42:21 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-9 05:22
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
三江| 伊金霍洛旗| 红原县| 崇阳县| 枣阳市| 朝阳区| 洞口县| 军事| 宜川县| 铜川市| 合肥市| 漳州市| 壤塘县| 天全县| 朝阳市| 建始县| 桃园市| 突泉县| 桃源县| 普兰县| 三河市| 五原县| 太湖县| 浠水县| 剑河县| 沙湾县| 北川| 会东县| 兴海县| 海伦市| 武平县| 江阴市| 桃江县| 长葛市| 信宜市| 周口市| 会同县| 黄梅县| 浦江县| 南康市| 图们市|