#datastructure

Data Structures And Algorithms FPT algorithms to recognize well covered graphs (1810.08276v4) Rafael Araujo, Eurinardo Costa, Sulamita Klein, Rudini Sampaio, Ueverton S. Souza 2018-10-18 Given a graph

Data Structures And Algorithms Connected max cut is polynomial for graphs without as a minor (1903.12641v1) Brahim Chaourar 2019-03-29 Given a graph , a connected cut is the set of edges of E linking all

Data Structures And Algorithms Faster Spectral Sparsification in Dynamic Streams (1903.12165v1) Michael Kapralov, Aida Mousavifar, Cameron Musco, Christopher Musco, Navid Nouri 2019-03-28 Graph sketching

Data Structures And Algorithms Faster Spectral Sparsification in Dynamic Streams (1903.12165v1) Michael Kapralov, Aida Mousavifar, Cameron Musco, Christopher Musco, Navid Nouri 2019-03-28 Graph sketching

Data Structures And Algorithms Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient (1810.01726v2) Surender Baswana, Shiv Kumar Gupta, Ayush Tulsyan 2018-10-03 We present an

Data Structures And Algorithms Malleable scheduling beyond identical machines (1903.11016v1) Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos 2019-03-26 In malleable job scheduling, jobs can

Data Structures And Algorithms Flow-Based Local Graph Clustering with Better Seed Set Inclusion (1811.12280v2) Nate Veldt, Christine Klymko, David Gleich 2018-11-29 Flow-based methods for local graph

Data Structures And Algorithms Approximating minimum representations of key Horn functions (1811.05160v2) Kristóf Bérczi, Endre Boros, Ondřej Čepek, Petr Kučera, Kazuhisa Makino 2018-11-13 Horn functions

Data Structures And Algorithms Exact Distance Oracles for Planar Graphs with Failing Vertices (1807.05968v2) Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka 2018-07-16 We consider exact distance

Data Structures And Algorithms Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs (1903.08603v1) Vincent Cohen-Addad, Éric Colin de Verdière, Daniel Marx, Arnaud de Mesmay 2019-03-20

Data Structures And Algorithms k-Means Clustering of Lines for Big Data (1903.06904v2) Yair Marom, Dan Feldman 2019-03-16 The k-means for lines is a set of k centers (points) that minimizes the sum of

Data Structures And Algorithms A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs (1804.03485v3) Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal 2018-04-10 A cactus graph is a graph

Data Structures And Algorithms Adversarial Bandits with Knapsacks (1811.11881v3) Nicole Immorlica, Karthik Abinav Sankararaman, Robert Schapire, Aleksandrs Slivkins 2018-11-28 We consider Bandits with

Data Structures And Algorithms Adversarial Bandits with Knapsacks (1811.11881v3) Nicole Immorlica, Karthik Abinav Sankararaman, Robert Schapire, Aleksandrs Slivkins 2018-11-28 We consider Bandits with

Data Structures And Algorithms Adversarial Bandits with Knapsacks (1811.11881v3) Nicole Immorlica, Karthik Abinav Sankararaman, Robert Schapire, Aleksandrs Slivkins 2018-11-28 We consider Bandits with

Data Structures And Algorithms A fast algorithm for maximal propensity score matching (1701.02201v7) Pavel S. Ruzankin 2017-01-09 We present a new algorithm which detects the maximal possible number of

Data Structures And Algorithms SFCM-R: A novel algorithm for the hamiltonian sequence problem (1902.06713v2) Cícero A. de Lima 2019-02-18 A hamiltonian sequence is a path walk that can be a hamiltonian

Data Structures And Algorithms Understanding Sparse JL for Feature Hashing (1903.03605v1) Meena Jagadeesan 2019-03-08 Feature hashing and more general projection schemes are commonly used in machine learning

Data Structures And Algorithms An algorithmic approach to the existence of ideal objects in commutative algebra (1903.03070v1) Thomas Powell, Peter M Schuster, Franziskus Wiesnet 2019-03-07 The existence

Data Structures And Algorithms An algorithmic approach to the existence of ideal objects in commutative algebra (1903.03070v1) Thomas Powell, Peter M Schuster, Franziskus Wiesnet 2019-03-07 The existence