找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: ;

[复制链接]
楼主: 小费
发表于 2025-3-26 23:39:58 | 显示全部楼层
发表于 2025-3-27 01:31:30 | 显示全部楼层
发表于 2025-3-27 05:45:36 | 显示全部楼层
发表于 2025-3-27 12:29:40 | 显示全部楼层
发表于 2025-3-27 14:24:36 | 显示全部楼层
发表于 2025-3-27 20:43:05 | 显示全部楼层
发表于 2025-3-28 01:34:50 | 显示全部楼层
,Parameterized Results on Acyclic Matchings with Implications for Related Problems,., . asks whether . has an acyclic matching of . (i.e., the number of edges) at least .. In this paper, we first prove that assuming ., there does not exist any .-approximation algorithm for . that approximates it within a constant factor when parameterized by .. Our reduction is general in the sens
发表于 2025-3-28 04:05:56 | 显示全部楼层
发表于 2025-3-28 08:38:07 | 显示全部楼层
发表于 2025-3-28 13:57:22 | 显示全部楼层
,Degreewidth: A New Parameter for Solving Problems on Tournaments,lic. The degreewidth of a tournament . denoted by . is the minimum value . for which we can find an ordering . of the vertices of . such that every vertex is incident to at most . backward arcs (. an arc . such that .). Thus, a tournament is acyclic if and only if its degreewidth is zero. Additional
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-22 02:39
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表