INTER
发表于 2025-4-1 04:13:21
,Online Interval Scheduling with Predictions,In the more general disjoint path allocation problem, the input is a sequence of requests, each involving a pair of vertices of a known graph, and the goal is to accept a maximum number of requests forming edge-disjoint paths between accepted pairs. These problems have been studied under extreme set
EVADE
发表于 2025-4-1 09:36:49
http://reply.papertrans.cn/16/1532/153143/153143_62.png
JADED
发表于 2025-4-1 13:34:45
http://reply.papertrans.cn/16/1532/153143/153143_63.png
Callus
发表于 2025-4-1 16:56:52
,Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs,ng set and maximum matching – on sparse graph classes, i.e., graphs which satisfy . where ., . is the number of edges, vertices respectively. Each graph parameter we consider can have size . even on sparse graph classes, and hence for sublinear-space algorithms we are restricted to parameter estimat
lymphoma
发表于 2025-4-1 22:30:10
http://reply.papertrans.cn/16/1532/153143/153143_65.png