Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • graph spanners 2016-05-31 Paper The incremental maintenance of a depth-first-search tree in directed acyclic graphs 2016-05-26 Paper On the Galois Lattice...
    10 bytes (18 words) - 15:23, 10 December 2023
  • of Publication Type Depth first exploration of a configuration model 2022-05-10 Paper Limiting shape of the depth first search tree in an Erdős‐Rényi graph...
    10 bytes (16 words) - 06:58, 7 October 2023
  • Transitive Closure 2017-06-15 Paper The incremental maintenance of a depth-first-search tree in directed acyclic graphs 2016-05-26 Paper Structure Theorems for...
    10 bytes (17 words) - 03:31, 9 December 2023
  • coupled with an Ising model 2020-12-18 Paper Limiting shape of the depth first search tree in an Erdős‐Rényi graph 2020-06-19 Paper The skeleton of the UIPT...
    10 bytes (17 words) - 09:58, 6 October 2023
  • with setup costs 2016-06-16 Paper The incremental maintenance of a depth-first-search tree in directed acyclic graphs 2016-05-26 Paper Min-max communities...
    10 bytes (17 words) - 18:14, 9 December 2023
  • Poisson-Voronoi sur une surface 2020-10-20 Paper Limiting shape of the depth first search tree in an Erdős‐Rényi graph 2020-06-19 Paper Empirical spectral distribution...
    10 bytes (16 words) - 15:30, 8 December 2023
  • 1999-03-01 Paper On the existence of special depth first search trees 1997-01-26 Paper Recognition of DFS trees: Sequential and parallel algorithms with refined...
    10 bytes (16 words) - 17:12, 6 October 2023
  • Publication Date of Publication Type On depth first search trees in \(m\)-out digraphs 1993-09-15 Paper On large induced trees and long induced paths in sparse...
    10 bytes (20 words) - 17:48, 6 October 2023
  • myopic search in a binary random vector 1998-11-29 Paper Testing Shared Memories 1998-02-10 Paper On the existence of special depth first search trees 1997-01-26...
    10 bytes (16 words) - 12:06, 9 December 2023
  • Paper Domination games on infinite graphs 1994-09-25 Paper The depth-first search tree structure of \(TK_{\aleph_ 0}\)-free graphs 1994-09-13 Paper Menger's...
    10 bytes (17 words) - 09:07, 9 December 2023
  • graph-theoretic approach 1984-01-01 Paper Series - parallel graphs and depth-first search trees 1984-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3325749 1984-01-01...
    10 bytes (19 words) - 12:50, 28 January 2024
  • analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph 1991-01-01 Paper On Counting Lattice...
    10 bytes (18 words) - 20:41, 9 December 2023
  • 4-spectrum of first-order properties of random graphs 2022-03-18 Paper Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth 2022-02-24...
    10 bytes (17 words) - 01:44, 10 December 2023
  • 2016-02-01 Paper On low tree-depth decompositions 2015-12-17 Paper First-order limits, an analytical perspective 2015-12-11 Paper On first-order definable colorings...
    10 bytes (21 words) - 13:39, 8 December 2023
  • randomized parallel algorithm for list-ranking 1990-01-01 Paper Parallel Depth-First Search in General Directed Graphs 1990-01-01 Paper https://portal.mardi4nfdi...
    10 bytes (18 words) - 00:27, 13 December 2023
  • analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph 1991-01-01 Paper https://portal.mardi4nfdi...
    10 bytes (19 words) - 17:12, 9 December 2023
  • weak method for learning 1985-01-01 Paper Depth-first iterative-deepening: An optimal admissible tree search 1985-01-01 Paper https://portal.mardi4nfdi...
    10 bytes (18 words) - 18:27, 9 December 2023
  • 2016-01-29 Paper Graphs Identified by Logics with Counting 2015-09-16 Paper Depth-First Search Using $$O(n)$$ Bits 2015-09-11 Paper A linear-time algorithm for testing...
    10 bytes (17 words) - 11:54, 11 December 2023
  • Self-stabilizing depth-first token circulation in arbitrary rooted networks 2020-12-03 Paper The first fully polynomial stabilizing algorithm for BFS tree construction...
    10 bytes (16 words) - 12:30, 28 January 2024
  • of Publication Type On a simple depth-first search strategy for exploring unknown graphs 2022-08-19 Paper Optimal search for rationals 2009-03-23 Paper...
    10 bytes (18 words) - 05:07, 9 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)