Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,273,724 papers from all fields of science
Search
Sign In
Create Free Account
Mixed graph
Known as:
Chain graph
, Mixed graphs
A mixed graph G = (V, E, A) is a mathematical object consisting of a set of vertices (or nodes) V, a set of (undirected) edges E, and a set of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Ancestral graph
Chromatic polynomial
GraphML
Graphical model
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Leader-Enabled Deployment Onto Planar Curves: A PDE-Based Approach
Paul Frihauf
,
M. Krstić
IEEE Transactions on Automatic Control
2011
Corpus ID: 10439621
We introduce an approach for stable deployment of agents onto families of planar curves, namely, 1-D formations in 2-D space. The…
Expand
Highly Cited
2011
Highly Cited
2011
Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
Alain Hauser
,
P. Bühlmann
Journal of machine learning research
2011
Corpus ID: 16393667
The investigation of directed acyclic graphs (DAGs) encoding the same Markov property, that is the same conditional independence…
Expand
Highly Cited
2003
Highly Cited
2003
Markov Properties for Acyclic Directed Mixed Graphs
T. Richardson
2003
Corpus ID: 18028656
We consider acycfic directed mixed graphs, in which directed edges (x->y) and bi-directed edges (x 4-+ y) may occur. A simple…
Expand
Highly Cited
2002
Highly Cited
2002
Ancestral graph Markov models
T. Richardson
,
P. Spirtes
2002
Corpus ID: 14025005
Abstract : This paper introduces a class of graphical independence models that is closed under marginalization and conditioning…
Expand
Highly Cited
2001
Highly Cited
2001
Network models for social selection processes
G. Robins
,
Peter Elliott
,
P. Pattison
Soc. Networks
2001
Corpus ID: 34404728
Highly Cited
2001
Highly Cited
2001
Alternative Markov Properties for Chain Graphs
S. A. Andersson
,
D. Madigan
,
M. Perlman
2001
Corpus ID: 15812872
Graphical Markov models use graphs to represent possible dependences among statistical variables. Lauritzen, Wermuth, and…
Expand
Highly Cited
2000
Highly Cited
2000
Maximum weight independent sets and cliques in intersection graphs of filaments
F. Gavril
Information Processing Letters
2000
Corpus ID: 31750321
Highly Cited
1996
Highly Cited
1996
Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
D. Madigan
,
S. A. Andersson
,
M. Perlman
,
C. Volinsky
1996
Corpus ID: 17424456
Acyclic digraphs (ADGs) are widely used to describe dependences among variables in multivariate distributions. In particular, the…
Expand
Highly Cited
1990
Highly Cited
1990
The chain graph Markov property
M. Frydenberg
1990
Corpus ID: 116029196
A new class of graphs, chain graphs, suitable for modelling conditional independencies are introduced and their Markov properties…
Expand
Review
1988
Review
1988
Automatic graph drawing and readability of diagrams
R. Tamassia
,
G. Battista
,
C. Batini
IEEE Transactions on Systems, Man and Cybernetics
1988
Corpus ID: 2980492
The state of the art in automatic graph drawing is reviewed, with special attention to the readability of information system…
Expand
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)
ACCEPT & CONTINUE