Les articles d'un sujet qui monte

GraTED: Graph--Tensor EEG Decoding for Passenger Hazard Perception in Autonomous Vehicles Yuxuan Gu, Yingkai Yang, Qiyu Rao, Tania Stathaki et al. · 2 Nov · cs.LG, cs.HC · emploie undirected graph
Finding and Certifying Weighted Minimum Cuts with Cut Queries Troy Lee · 2 Nov · cs.DS · emploie undirected graph
Dynamic Steiner Tree under Edge Updates Jeff Giliberti, MohammadTaghi Hajiaghayi, Mohammad Mahdavi, Xinchen Yang · 3 Nov · cs.DS · emploie undirected graph
First Near-Additive All-Pairs Approximate Shortest Paths in Decremental Weighted Graphs Eden Koveshi, Liam Roditty, Ariel Sapir · 3 Nov · cs.DS · emploie undirected graph
Tree Covers for Directed Graphs: Distance Oracles, Routing Schemes and Spanners Shiri Chechik, Gur Lifshitz · 3 Nov · cs.DS · emploie undirected graph
Approximation Algorithms for Multi-Criteria Network Design Problems Mehrshad Taziki, Ali Vakilian · 3 Nov · cs.DS · emploie undirected graph
Optimal (Randomized) Compact Routing Schemes Shiri Chechik, Avi Kadria, Gur Lifshitz, Liam Roditty · 3 Nov · cs.DS, cs.NI · emploie undirected graph
The Power of Interaction in Locally Edge-Private Subgraph Counting Xian Chen, Pan Peng · 3 Nov · cs.DS, cs.CR · emploie undirected graph
Faster Dynamic Maximal Independent Set against Adaptive Adversaries Hongyi Chen, Shuyan Fan, Tianyi Zhang · 4 Nov · cs.DS · emploie undirected graph
A Dichotomy for Terminal Cyclability Matthias Bentert, Dario Cavallaro, Sebastian Wiederrecht · 4 Nov · cs.DS · emploie undirected graph
Polynomial $(2\alpha+\varepsilon)$- and Quadratic $4$-Approximation Algorithms for the Biased Traveling Salesman Problem in Bipartitioned Networks Jingyang Zhao, Trung Q. Duong, Een-Kee Hong, Hyundong Shin · 4 Nov · cs.DS · emploie undirected graph
Beyond Gomory-Hu: All-Pairs $\times$ All-Pairs Mincuts in $O(n)$ Space Koustav Bhanja, Merav Parter, Asaf Petruschka · 4 Nov · cs.DS · emploie undirected graph
Computing Forest Degree Realizations with Minimum Cardinality Domination Amotz Bar-Noy, Omri Kosary, David Peleg, Dror Rawitz · 4 Nov · cs.DS, cs.DM · emploie undirected graph
Uniqueness and full coverage in $k$-neighbor graphs David Coupier, Beno\^it Henry, Benedikt Jahnel, Jonas K\"oppl · 4 Nov · math.PR · emploie undirected graph
Boxicity of Power Graphs of Finite Nilpotent Groups L. Sunil Chandran, Jinia Ghosh, Suraj Kumar Sahoo · 4 Nov · cs.DM, math.CO, math.GR · emploie undirected graph
Nonuniform Buy-at-Bulk Network Design: Improved Approximation and LP Integrality Gap Iman Gholami, MohammadTaghi Hajiaghayi · 4 Nov · cs.DS · emploie undirected graph
A Simple Subquadratic Cut Query Protocol for Directed Reachability Henry Fleischmann, Sagnik Mukhopadhyay, Swagato Sanyal · 4 Nov · cs.DS · emploie undirected graph
Polynomial Lower Bounds for Steiner Shortcuts via Test Functions Aaron Bernstein, Henry Fleischmann, Bernhard Haeupler, Gary Hoppenworth et al. · 4 Nov · cs.DS · emploie undirected graph
Constant-Factor Approximations for the Biased Traveling Salesman Problem and Its Path Variant Jingyang Zhao, Jason William Setiawan, Uman Khalid, Chaoning Zhang et al. · 5 Nov · cs.DS · emploie undirected graph
Minimum-Cost $k$-Arborescence Packing in $\tilde O(km+k^4 n)$ Time Zhaienhe Zhou · 5 Nov · cs.DS · emploie undirected graph
A Near-Optimal Generalized Sorting Algorithm Sanjeev Khanna, Aaron Putterman, Junkai Song · 5 Nov · cs.DS · emploie undirected graph
Canonical Cut Hierarchy in Almost-Linear Time via Reduction to Max-Flow Karthekeyan Chandrasekaran, Harshul Sagar · 5 Nov · cs.DS · emploie undirected graph
Interacting Urn Schemes on Infinite Graphs: A Representation Approach Antar Bandyopadhyay, Deborshi Das · 5 Nov · math.PR · emploie undirected graph
Flexible Edge Cover: A Disjunctive Programming driven Approximation Karthekeyan Chandrasekaran, Krishna Kalathur · 6 Nov · cs.DS · emploie undirected graph
Path Isolation and Reachability in Surface-Embedded Graphs with Restricted Cycle and Cut Structure Neelabjo Shubhashis Choudhury, Chetan Gupta, Raghunath Tewari · 6 Nov · cs.CC · emploie undirected graph