找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: CHAFF
发表于 2025-3-25 05:13:28 | 显示全部楼层
发表于 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
发表于 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
发表于 2025-3-25 18:55:48 | 显示全部楼层
发表于 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.
发表于 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-
发表于 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
发表于 2025-3-26 11:51:56 | 显示全部楼层
发表于 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
发表于 2025-3-26 20:42:21 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-29 06:03
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表