Skip to search formSkip to main contentSkip to account menu

Ordered graph

An ordered graph is a graph with a total order over its nodes. In an ordered graph, the parents of a node are the nodes that are joined to it and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Complexity of constraint satisfactionDecomposition method (constraint satisfaction)Directed graphEvent-driven process chain

Broader (1)

Constraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Limits of Ordered Graphs and Images
The emerging theory of graph limits exhibits an interesting analytic perspective on graphs, showing that many important concepts… 
2016
2016
The Treewidth of Induced Graphs of Conditional Preference Networks Is Small
Conditional preference networks (CP-nets) are recently an emerging topic as a graphical model for compactly representing ordinal… 
2015
2015
Modélisation ontologique des recommandations de pratique clinique pour une aide à la décision à niveaux d'abstraction variables. (Ontological modeling of clinical practice guidelines to provide…
Conformement aux principes de la medecine factuelle, les guides de bonne pratique clinique (GBPC) sont elabores dans un but d… 
Review
2009
Review
2009
Post-Processing Elimination Orderings to Reduce Induced Width
The induced width along an elimination ordering is an important factor in the space and time complexity of many inference… 
2008
2008
Chemical complexity and molecular topology: The DARC concepts and applications
Dans les annees 50, il a ete observe que la position relative des atomes de carbone situes dans l'environnement immediat de la… 
2007
2007
Induced Graph Semantics: Another Look at the Hammersley-Clifford Theorem
2003
2003
Generation of Random Bayesian Networks with Constraints on Induced Width , with Application to the Average Analysis of d-Connectivity , Quasi-random Sampling , and Loopy Propagation
We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The… 
1986
1986
On Partially Ordered Graph Grammars
  • F. Brandenburg
  • Graph-Grammars and Their Application to Computer…
  • 1986
  • Corpus ID: 36316594
Graph grammars are systems for the generation of directed, node and edge labeled graphs. They rewrite single nodes only and… 
1980
1980
Properties of Ordered Graph Grammars
A method for the ordering of graphs by means of an extension to the concept of graph grammars is given. These orderings, which… 
1980
1980
A LR-Like Analyzer Algorithm for Graphs
The lack of linear orderings in graphs is a major obstacle in the extension of powerful syntactic analysis methods to graphs. One… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)