Filters
Characterization of essential graphs by means of the operation of legal merging of components
networks is the use of essential graphs.In the paper their characterization is presented. The main observation is that every essential graph is the largest chain graph withina special class of chain graphs
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Characterization of essential graphs by means of an operation of legal component merging.
The essential graph is known as a representative of an equivalence class of Bayesian networks. In the contribution an alternative characterization of essential graphs is presented. The characterization is based on ...
BA - Obecná matematika
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
The hamiltonicity of essentially 9-connected line graphs
Yang et al proved that every 3‐connected, essentially 11‐connected line graph is Hamilton‐connected. This was extended by Li and Yang to 3‐connected, essentially 10‐connected line graphs. Strengthening their result...
Pure mathematics
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
A reconstruction algorithm for the essential graph
A standard graphical representative of a Bayesian network structure is a special chain graphs, known as an essential graph. An alternative algebraic approach the essential graph on the basis of the standar...
BA - Obecná matematika
- 2009 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Connected even factors in the square of essentially 2-edge-connected graph
An essentially k-edge connected graph G is a connected graph such that deleting we prove that if an essentially 2-edge-connected graph G satisfies that for any degree at most 4. Moreover we show that, in g...
Pure mathematics
- 2017 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Characterization of inclusion neighbourhood in terms of the essential graph: Lower neighbours.
The topic of the paper is to characterize inclusion neighbourhood of a given equivalence class of Bayesian networks in terms of the respective essential graph tufts. The least and maximal sets of these tufts can be read from the
BA - Obecná matematika
- 2003 •
- D
Rok uplatnění
D - Stať ve sborníku
Characterization of inclusion neighbourhood in terms of the essential graph
of the respective standard representative of the equivalence class, which is named the essential graph.
BA - Obecná matematika
- 2005 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Characterization of inclusion neighbourhood in terms of the essential graph: upper neighbours.
Neighbouring equivalence classes in the sense of inclusion neighbourhood are characterized efficiently in terms of the respective essential graph. The given characterization reveals hidden internal structure of the inclusion neighbo...
BA - Obecná matematika
- 2003 •
- D
Rok uplatnění
D - Stať ve sborníku
Transition between graphical and algebraic representatives of Bayesian network models
In learning Bayesian networks one meets the problem of unique representing of the respective statistical model. A graphical approach uses so-called essential graph as a represententative while an algebraic approach uses a certain in...
BA - Obecná matematika
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
Homomorphisms of Signed Graphs
The paper studies a new concept of homomorphisms on signed graphs. It establishes essential results and states several conjectures and open problems....
BA - Obecná matematika
- 2015 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
- 1 - 10 out of 29 907