Directed transit functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 439012 (Why is no real title available?)
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 1539545 (Why is no real title available?)
- scientific article; zbMATH DE number 1842910 (Why is no real title available?)
- scientific article; zbMATH DE number 1449370 (Why is no real title available?)
- scientific article; zbMATH DE number 5499517 (Why is no real title available?)
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
- A Helly theorem in weakly modular space
- A characterization of the interval function of a connected graph
- A faster algorithm for betweenness centrality*
- A note on the interval function of a disconnected graph
- About directed \(d\)-convex simple graphs
- An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
- An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering
- Axiomatic characterization of the interval function of a graph
- Axiomatic characterization of the toll walk function of some graph classes
- Axiomatic characterization of transit functions of hierarchies
- Axiomatic characterizations of Ptolemaic and chordal graphs
- Betweenness in graphs: a short survey on shortest and induced path betweenness
- Betweenness of partial orders
- Binary clustering
- Characterizing posets for which their natural transit functions coincide
- Distance-hereditary digraphs
- Distance-hereditary graphs
- Finite Sholander trees, trees, and their betweenness
- First-order logic axiomatization of metric graph theory
- Induced path transit function, monotone and Peano axioms
- Linear connectivity problems in directed hypergraphs
- RUSPACE\((\log n)\subseteq \text{DSPACE}(\log^2n/\log \log n)\)
- The All-Paths Transit Function of a Graph
- The Transitive Reduction of a Directed Graph
- The axiomatic characterization of the interval function of distance hereditary graphs
- The geodetic number of an oriented graph
- The induced path function, monotonicity and betweenness
- The weak-toll function of a graph: axiomatic characterizations and first-order non-definability
- Toll convexity
- Transit function on posets and lattices
- Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs
- Weak hierarchies associated with similarity measures - An additive clustering technique
This page was built for publication: Directed transit functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7020207)
