Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,434,873 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.
2017
2017
On Relationship between Primal-Dual Method of Multipliers and Kalman Filter
Guoqiang Zhang
,
W. Kleijn
,
R. Heusdens
arXiv.org
2017
Corpus ID: 30595541
Recently the primal-dual method of multipliers (PDMM), a novel distributed optimization method, was proposed for solving a…
Expand
2014
2014
Simulating the Need for Health- and Elderly Care in Sweden – A Model Description of SESIM-LEV
L. Brouwers
,
L. Ellegård
,
Nils Janlöv
,
P. Johansson
,
Karin Mossler
,
A. Ekholm
2014
Corpus ID: 70495058
Simulating the need for health- and elderly care in Sweden - A model description of SESIM-LEV
2013
2013
Rate optimization for relay-assisted downlink cellular systems using superposition coding
S. Rini
,
Levan Ghaghanidze
,
E. Kurniawan
,
A. Goldsmith
IEEE International Conference on Communications…
2013
Corpus ID: 28021657
A downlink cellular system in which multiple relays assist the transmission of the base station is considered. Cooperation…
Expand
2012
2012
Mining Data Chain Graph for Fault Localization
Bo Yang
,
Ji Wu
,
Chao Liu
IEEE 36th Annual Computer Software and…
2012
Corpus ID: 15595762
Fault localization is a challenging task in domain specific data mining. Most existing works focus on call graph that can find…
Expand
2011
2011
Two characterizations of chain partitioned probe graphs
V. B. Le
Annals of Operations Research
2011
Corpus ID: 26114539
Chain graphs are exactly bipartite graphs without induced 2K2 (a graph with four vertices and two disjoint edges). A graph G=(V,E…
Expand
2011
2011
An Achievable Region for a General Multi-terminal Network and the corresponding Chain Graph Representation
S. Rini
arXiv.org
2011
Corpus ID: 28915123
Random coding, along with various standard techniques such as coded time-sharing, rate-splitting, superposition coding, and…
Expand
2011
2011
An Achievable Region for a General Multi-terminal Network and its Chain Graph Representation
S. Rini
arXiv.org
2011
Corpus ID: 14702394
Random coding, along with various standard techniques such as coded time-sharing, rate-splitting, superposition coding, and…
Expand
2010
2010
Informed Lifting for Message-Passing
K. Kersting
,
Youssef El Massaoudi
,
Fabian Hadiji
,
B. Ahmadi
AAAI Conference on Artificial Intelligence
2010
Corpus ID: 11042263
Lifted inference, handling whole sets of indistinguishable objects together, is critical to the effective application of…
Expand
2003
2003
Graphical Models for Surrogates
S. Lauritzen
2003
Corpus ID: 14444263
Recently, it has been demonstrated that graphical models promise some potential for expressing causal concepts, see for example…
Expand
1992
1992
A Graphics Application Extension for a Simulated Decision Support System Environment
Charles K. Woodruff
1992
Corpus ID: 64579345
"A procedure is described whereby a structured set of graphics produced by the Harvard Graphics personal computer software…
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