Search results
From MaRDI portal
- de/entity/Q5111459 2020-05-27 Paper Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier 2019-09-02 Paper Dynamic DFS in Undirected Graphs: breaking the...10 bytes (16 words) - 22:21, 24 September 2023
- Publication Date of Publication Type Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier 2019-09-02 Paper Dynamic DFS in Undirected Graphs: breaking the...10 bytes (18 words) - 20:57, 26 December 2023
- Space-efficient fully dynamic DFS in undirected graphs 2019-07-08 Paper A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs 2017-05-05...10 bytes (16 words) - 18:25, 6 October 2023
- of constraint-based reasoning. An introductory tutorial 2014-08-14 Paper DFS* and the Traveling Tournament Problem 2009-06-03 Paper https://portal.mardi4nfdi...10 bytes (18 words) - 18:46, 11 December 2023
- Towards Knowledgeable Supervised Lifelong Learning Systems 2020-06-26 Paper DFS* and the Traveling Tournament Problem 2009-06-03 Paper Scaling up inductive...10 bytes (18 words) - 15:35, 9 December 2023
- Publication Date of Publication Type DFS tree construction: Algorithms and characterizations 2024-02-28 Paper https://portal.mardi4nfdi.de/entity/Q4232879...10 bytes (16 words) - 17:12, 6 October 2023
- maintenance 2020-02-24 Paper Space efficient linear time algorithms for BFS, DFS and applications 2019-09-05 Paper Maintaining chordal graphs dynamically:...10 bytes (16 words) - 17:47, 24 September 2023
- Publication Date of Publication Type Simple DFS on the complement of a graph and on partially complemented digraphs 2016-10-06 Paper Linear-time recognition...10 bytes (18 words) - 01:16, 11 December 2023
- Publication Date of Publication Type DFS tree construction: Algorithms and characterizations 2024-02-28 Paper Magnifying computing gaps. Establishing encrypted...10 bytes (16 words) - 12:06, 9 December 2023
- realizations and applications to social networks 2019-10-15 Paper Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier 2019-09-02 Paper An efficient...10 bytes (16 words) - 11:11, 6 October 2023
- \(st\)-numbering and other applications of DFS using \(O(n)\) bits 2017-09-15 Paper Improved Space Efficient Algorithms for BFS, DFS and Applications 2016-09-02 Paper...10 bytes (16 words) - 09:51, 6 October 2023
- PLANARITY 2006-10-16 Paper Graph Drawing 2005-12-07 Paper On Cotree-Critical and DFS Cotree-Critical Graphs 2005-05-25 Paper https://portal.mardi4nfdi.de/entity/Q3043707...10 bytes (19 words) - 16:32, 8 December 2023
- Paper https://portal.mardi4nfdi.de/entity/Q5111403 2020-05-27 Paper Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier 2019-09-02 Paper https://portal...10 bytes (16 words) - 11:11, 6 October 2023
- Publication Date of Publication Type Automated Verification of Parallel Nested DFS 2022-10-13 Paper Formalizing the LLL basis reduction algorithm and the LLL...10 bytes (20 words) - 19:38, 13 December 2023
- PLANARITY TESTING AND CONSTRUCTING THE TOPOLOGICAL DRAWING OF A PLANE GRAPH (DFS) 2021-02-15 Paper...10 bytes (18 words) - 22:38, 27 December 2023
- Publication Date of Publication Type DFS* and the Traveling Tournament Problem 2009-06-03 Paper...10 bytes (18 words) - 19:50, 26 December 2023
- Distribution: An Application to Detecting Radiological Anomalies 2019-08-27 Paper The DFS Fused Lasso: Linear-Time Denoising over General Graphs 2018-11-22 Paper A...10 bytes (20 words) - 17:47, 13 December 2023
- based fuzzy fractal dimension integrating self-similarity and porosity, via DFS and FIS (Mamdani and Sugeno systems) 2022-04-14 Paper...10 bytes (16 words) - 14:30, 24 September 2023
- based fuzzy fractal dimension integrating self-similarity and porosity, via DFS and FIS (Mamdani and Sugeno systems) 2022-04-14 Paper...10 bytes (16 words) - 14:30, 24 September 2023
- based fuzzy fractal dimension integrating self-similarity and porosity, via DFS and FIS (Mamdani and Sugeno systems) 2022-04-14 Paper...10 bytes (16 words) - 14:30, 24 September 2023
