会员服务
Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
Arxiv
0+阅读 · 10月23日
Undirected Multicast Network Coding Gaps via Locally Decodable Codes
Arxiv
0+阅读 · 10月21日
Minimum $s$--$t$ Cuts with Fewer Cut Queries
Arxiv
0+阅读 · 10月21日
Odd and Even Harder Problems on Cycle-Factors
Arxiv
0+阅读 · 10月21日
Brute-force search and Warshall algorithms for matrix-weighted graphs
Arxiv
0+阅读 · 10月21日
Weighted Treedepth is NP-complete on Graphs of Bounded Degree
Arxiv
0+阅读 · 10月21日
Graph Burning: Bounds and Hardness
Arxiv
0+阅读 · 10月18日
Faster algorithms for packing forests in graphs and related problems
Arxiv
0+阅读 · 10月15日
Lossless Derandomization for Undirected Single-Source Shortest Paths and Approximate Distance Oracles
Arxiv
0+阅读 · 10月14日
The Complexity of Contracting Bipartite Graphs into Small Cycles
Arxiv
0+阅读 · 10月14日
Observer-Based Source Localization in Tree Infection Networks via Laplace Transforms
Arxiv
0+阅读 · 10月10日
Lower Bounds for $k$-Set Agreement in Fault-Prone Networks
Arxiv
0+阅读 · 10月10日
Realization of Temporally Connected Graphs Based on Degree Sequences
Arxiv
0+阅读 · 10月9日
Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions
Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions
Arxiv
0+阅读 · 10月8日
Parallel Complexity of Depth-First-Search and Maximal path in restricted graph classes
Arxiv
0+阅读 · 10月7日
参考链接
微信扫码咨询专知VIP会员
Top