Search Results - "Computer Science - Data Structures and Algorithms"

SciPy 1.0: fundamental algorithms for scientific computing in Python by Virtanen, Pauli, Gommers, Ralf, Oliphant, Travis E., Haberland, Matt, Reddy, Tyler, Cournapeau, David, Burovski, Evgeni, Peterson, Pearu, Weckesser, Warren, Bright, Jonathan, van der Walt, Stéfan J., Brett, Matthew, Wilson, Joshua, Millman, K. Jarrod, Mayorov, Nikolay, Nelson, Andrew R. J., Jones, Eric, Kern, Robert, Larson, Eric, Carey, C J, Polat, İlhan, Feng, Yu, Moore, Eric W., VanderPlas, Jake, Laxalde, Denis, Perktold, Josef, Cimrman, Robert, Henriksen, Ian, Quintero, E. A., Harris, Charles R., Archibald, Anne M., Ribeiro, Antônio H., Pedregosa, Fabian, van Mulbregt, Paul

“…SciPy is an open-source scientific computing library for the Python programming language. Since its initial release in 2001, SciPy has become a de facto…”
Get full text

Testing Distributions of Huge Objects by Goldreich, Oded, Ron, Dana

“…We initiate a study of a new model of property testing that is a hybrid of testing properties of distributions and testing properties of strings. Specifically,…”
Get full text

Fully Dynamic Connectivity in$O(\log n(\log\log n)^2)$Amortized Expected Time by Huang, Shang-En, Huang, Dawei, Kopelowitz, Tsvi, Pettie, Seth, Thorup, Mikkel

“…Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a randomized Las Vegas dynamic connectivity data structure…”
Get full text

Approximating Maximum Edge 2-Coloring by Normalizing Graphs by Mömke, Tobias, Popa, Alexandru, Roshany-Tabrizi, Aida, Ruderer, Michael, Vincze, Roland

“…In a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors. The…”
Get full text

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for$\Delta$ -Coloring by Assadi, Sepehr, Kumar, Pankaj, Mittal, Parth

“…Every graph with maximum degree$\Delta$can be colored with$(\Delta+1)$colors using a simple greedy algorithm. Remarkably, recent work has shown that one can…”
Get full text

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs by Balzotti, Lorenzo

“…A path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and…”
Get full text

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions by Alecu, Bogdan, Kanté, Mamadou Moustapha, Lozin, Vadim, Zamaraev, Viktor

“…Lettericity is a graph parameter responsible for many attractive structural properties. In particular, graphs of bounded lettericity have bounded linear…”
Get full text

Exactly Hittable Interval Graphs by Dhannya, S. M., Narayanaswamy, N. S., Nisha, K. K.

“…Given a set system$\mathcal{X} = \{\mathcal{U},\mathcal{S}\}$ , where$\mathcal{U}$is a set of elements and$\mathcal{S}$is a set of subsets of$\mathcal{U}$ , an…”
Get full text

On-line algorithms for multiplication and division in real and complex numeration systems by Frougny, Christiane, Pavelka, Marta, Pelantova, Edita, Svobodova, Milena

“…A positional numeration system is given by a base and by a set of digits. The base is a real or complex number$\beta$such that$|\beta|>1$ , and the digit…”
Get full text

Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models by Georgiou, Konstantinos, Karakostas, George, Kranakis, Evangelos

“…We initiate the study of a new problem on searching and fetching in a distributed environment concerning treasure-evacuation from a unit disk. A treasure and…”
Get full text

Introduction to local certification by Feuilloley, Laurent

“…A distributed graph algorithm is basically an algorithm where every node of a graph can look at its neighborhood at some distance in the graph and chose its…”
Get full text

Polynomial kernels for edge modification problems towards block and strictly chordal graphs by Dumas, Maël, Perez, Anthony, Rocton, Mathis, Todinca, Ioan

“…We consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph$G = (V,E)$and an integer$k \in…”
Get full text

Token Swapping on Trees by Biniaz, Ahmad, Jain, Kshitij, Lubiw, Anna, Masárová, Zuzana, Miltzow, Tillmann, Mondal, Debajyoti, Naredla, Anurag Murty, Tkadlec, Josef, Turcotte, Alexi

“…The input to the token swapping problem is a graph with vertices$v_1, v_2, \ldots, v_n$ , and$n$tokens with labels$1, 2, \ldots, n$ , one on each vertex. The…”
Get full text

Constant-delay enumeration for SLP-compressed documents by Muñoz, Martín, Riveros, Cristian

“…We study the problem of enumerating results from a query over a compressed document. The model we use for compression are straight-line programs (SLPs), which…”
Get full text

Fine-grained Meta-Theorems for Vertex Integrity by Lampis, Michael, Mitsou, Valia

“…Vertex Integrity is a graph measure which sits squarely between two more well-studied notions, namely vertex cover and tree-depth, and that has recently gained…”
Get full text

A Practical Algorithm with Performance Guarantees for the Art Gallery Problem by Hengeveld, Simon, Miltzow, Tillmann

“…Given a closed simple polygon$P$ , we say two points$p,q$see each other if the segment$pq$is fully contained in$P$ . The art gallery problem seeks a minimum…”
Get full text

A tree structure for dynamic facility location by Henzinger, Monika, Leniowski, Dariusz, Mathieu, Claire

“…In this paper, we study the problem of dynamic facility location. We maintain a solution with cost O(1) times the cost of an optimal solution in metric spaces…”
Get full text

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions by Feng, Weiming, Guo, Heng, Jerrum, Mark, Wang, Jiaheng

“…We give a simple polynomial-time approximation algorithm for the total variation distance between two product distributions…”
Get full text

Optimizing tree decompositions in MSO by Bojańczyk, Mikołaj, Pilipczuk, Michał

“…The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves the following problem in linear fixed-parameter time: given a tree decomposition of…”
Get full text

An improved algorithm for the vertex cover$P_3$problem on graphs of bounded treewidth by Bai, Zongwen, Tu, Jianhua, Shi, Yongtang

“…Given a graph$G=(V,E)$and a positive integer$t\geq2$ , the task in the vertex cover$P_t$( $VCP_t$ ) problem is to find a minimum subset of vertices$F\subseteq…”
Get full text