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

“… Since its initial release in 2001, SciPy has become a de facto standard for leveraging scientific algorithms in Python, with over 600 unique code contributors, thousands of dependent packages…”
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

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

“… However, no constructive algorithms and no specific bounds on the size of forbidden graphs are available up to date…”
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

“… We present a randomized Las Vegas dynamic connectivity data structure with$O(\log n(\log\log n)^2)$amortized expected update time…”
Get full text

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

“… For the problem a 2-approximation algorithm is known, and if the input graph has a perfect matching, the same algorithm has been shown to have a performance guarantee of 5/3…”
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 output…”
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…”
Get full text

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

“… Our algorithm does not require complex data structures and has an easy and intuitive implementation, simplifying recognition algorithms for both graph classes. Comment…”
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

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

“… in$P$ . The art gallery problem seeks a minimum size set$G\subset P$of guards that sees$P$completely. The only currently correct algorithm to solve the art gallery problem exactly uses algebraic methods and is attributed to Sharir…”
Get full text

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

“… This model extends the notion of Regular Spanners as it allows arbitrarily long outputs. Our main result is an algorithm that evaluates such a query by enumerating…”
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

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

“… An on-line algorithm processes the input piece-by-piece in a serial fashion. On-line arithmetic, introduced by Trivedi and Ercegovac, is a mode of computation…”
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

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

“… We refer to these interval graphs as exactly hittable interval graphs (EHIG). We present a forbidden structure characterization for EHIG…”
Get full text

Composing dynamic programming tree-decomposition-based algorithms by Baste, Julien

“…$ . We show that if there exist dynamic programming tree-decomposition-based algorithms for recognizing the graph classes$\mathcal{H}_i$ , for each…”
Get full text

New Algorithms for Mixed Dominating Set by Dublois, Louis, Lampis, Michael, Paschos, Vangelis Th

“… We study the complexity of exact and parameterized algorithms for Mixed Dominating Set, resolving some open questions…”
Get full text

On the Advice Complexity of Online Matching on the Line by Csaba, Béla, Nagy-György, Judit

“…We consider the matching problem on the line with advice complexity. We give a 1-competitive online algorithm with advice complexity$n-1…”
Get full text

Verified Approximation Algorithms by Eßmann, Robin, Nipkow, Tobias, Robillard, Simon, Sulejmani, Ujkan

“…We present the first formal verification of approximation algorithms for NP-complete optimization problems…”
Get full text

Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms by Blin, Lélia, Feuilloley, Laurent, Bouder, Gabriel Le

“…), a self-stabilizing algorithm for$\Pi$is a distributed algorithm that can start from any initial configuration of the network (i.e…”
Get full text