找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: LATIN 2008: Theoretical Informatics; 8th Latin American S Eduardo Sany Laber,Claudson Bornstein,Luerbio Fari Conference proceedings 2008 Sp

[复制链接]
楼主: Deflated
发表于 2025-3-25 03:41:53 | 显示全部楼层
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Awae construction of such sets should be . in the sense that each node of the network should make decisions based only on the information obtained from nodes located a constant number of hops from it. In this paper we use the . of the network, i.e. the knowledge of position of nodes in the plane to pro
发表于 2025-3-25 11:04:01 | 显示全部楼层
Spanners of Complete ,-Partite Geometric Graphs,t has a “small” stretch factor and “few” edges. We present two algorithms for this problem. The first algorithm computes a (5 + .)-spanner of . with .(.) edges in .(. log.) time. The second algorithm computes a (3 + .)-spanner of . with .(. log.) edges in .(. log.) time. Finally, we show that there
发表于 2025-3-25 14:26:09 | 显示全部楼层
Minimum Cost Homomorphisms to Reflexive Digraphs,morphism to . of total cost not exceeding ...Minimum cost homomorphism problems encompass many well studied optimization problems such as list homomorphism problems, retraction and precolouring extension problems, chromatic partition optimization, and applied problems in repair analysis..For undirec
发表于 2025-3-25 17:57:55 | 显示全部楼层
On the Complexity of Reconstructing ,-free Graphs from Their Star Systems,given subsets . .,. ., ⋯ ,. . of an .-element set . does there exist a graph . = (.,.) with {.[.]: . ∈ .} = {. .,. ., ⋯ ,. .}? For a fixed graph . the .-free Star System problem is a variant of the Star System problem where it is asked whether a given set system is realizable by closed neighborhoods
发表于 2025-3-25 21:07:01 | 显示全部楼层
Optimization and Recognition for ,,-minor Free Graphs in Linear Time, one. If the input graph has no . .-minor then the algorithm constructs a tree decomposition such that each node of the tree corresponds to a planar graph or a graph with eight vertices. Such a decomposition can be used to obtain algorithms to solve various optimization problems in linear time. For
发表于 2025-3-26 03:50:37 | 显示全部楼层
发表于 2025-3-26 07:01:06 | 显示全部楼层
发表于 2025-3-26 08:35:19 | 显示全部楼层
发表于 2025-3-26 15:05:27 | 显示全部楼层
I. Rapaport,K. Suchan,I. Todinca,J. Verstraete and in order to be relevant models must be constructed on a similar scale, several orders of magnitude greater than the objects that are normally attributed to the physicist‘s sphere of interest. The mechanicist is therefore aware of the limits of these models, no matter how elegant their mathemati
发表于 2025-3-26 20:40:05 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-24 11:52
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表