Live briefing
Everything about Polytree
Type of graph in mathematics
In mathematics, and more specifically in graph theory, a polytree is a directed acyclic graph whose underlying undirected graph is a tree. In other words, a polytree is formed by assigning an orientation to each edge of a connected and acyclic undirected graph. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: PolytreeA 5-minute orientation
- Skim a recent paper: A flexible solution for seepage problems integrating SBFEM and recursive polytree meshingInfluential work since 2022
- Pick up a classic book: Probabilistic reasoning in intelligent systemsThe most-reprinted book on the subject
- Read the landmark paper: A polytree-based adaptive approach to limit analysis of cracked structuresCited 102 times
- Go sideways: Orientation (graph theory)A closely related topic
- Go sideways: Directed graphA closely related topic
📖 Definitions
Noun a graph with at most one undirected path between any two vertices. In other words, a directed acyclic graph (DAG) for which there are no undirected cycles either.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A polytree-based adaptive approach to limit analysis of cracked structures
A polytree‐based adaptive polygonal finite element method for topology optimization
A polytree-based adaptive polygonal finite element method for multi-material topology optimization
Stability of traffic flow networks with a polytree topology
Multi-material topology optimization for additive manufacturing using polytree-based adaptive polygonal finite elements
A polytree based coupling method for non-matching meshes in 3D
A polytree-based adaptive polygonal finite element method for topology optimization of fluid-submerged breakwater interaction
Slope stability analysis based on SBFEM and multistage polytree-based refinement algorithms
🆕 Influential since 2022
A flexible solution for seepage problems integrating SBFEM and recursive polytree meshing
Polytree-based adaptive bubble-enriched smoothed polygonal finite element method for dual yield structural design
Learning Linear Gaussian Polytree Models With Interventions
An advanced PolyTree-SIMP-OC topology optimization for incompressible stokes flow using equal-order polygonal finite elements
PolyTree-Soft Sets and PolyForest-Soft Sets: A Directed Acyclic Framework for Soft Set Modeling
📚 Books worth reading
Probabilistic reasoning in intelligent systemsJudea Pearl · 1988
Uncertainty in artificial intelligence 3Laveen N. Kanal, Tod S. Levitt · 1989
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Orientation (graph theory) In graph theory, an orientation of an undirected graph is an assignment of a direction to each edge, turning the initial graph into a directed graph. A…
- Directed graph In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed…
- Sumner's conjecture Unsolved problem in mathematics Does every ( 2 n − 2 ) {\displaystyle (2n-2)} -vertex tournament contain as a subgraph every n {\displaystyle n} -vertex…
- Tree (graph theory) In graph theory, a tree is an undirected graph in which every pair of distinct vertices is connected by exactly one path, or equivalently, a connected…
- Directed acyclic graph In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it…
- Graphoid A graphoid is a set of statements of the form, "X is irrelevant to Y given that we know Z" where X, Y and Z are sets of variables. The notion of "irrelevance"…
- Graph (discrete mathematics) In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some…
- Arborescence (graph theory) In graph theory, an arborescence is a directed graph where there exists a vertex r (called the root) such that, for any other vertex v, there is exactly…