Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Daniel Johannsen
Expanders Are Universal for the Class of All Spanning Trees (Extended Abstract)
Related publications
An Algorithm for Enumerating All Spanning Trees of a Directed Graph
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
Density-Equalizing Euclidean Minimum Spanning Trees for the Detection of All Disease Cluster Shapes
Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
Categorical Views on Computations on Trees (Extended Abstract)
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Algorithms for Generating All Possible Spanning Trees of a Simple Undirected Connected Graph: An Extensive Review
Complex & Intelligent Systems
Finding the K Smallest Spanning Trees
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Universal Rights Are Not for All: Paradox of Modern Humanitarian Discourse
Bulletin of the Moscow State Regional University
Balanced Partition of Minimum Spanning Trees
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs (Extended Abstract)
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
