Results 161 to 170 of about 51,213 (189)

The w‐median of a connected strongly chordal graph

Journal of Graph Theory, 1994
AbstractSuppose G = (V, E) is a graph in which every vertex x has a non‐negative real number w(x) as its weight. The w‐distance sum of a vertex y is DG, w(y) = σx≅v d(y, x)w(x). The w‐median of G is the set of all vertices y with minimum w‐distance sum DG,w(y).
Lee, Hai-Yen, Chang, Gerard J.
openaire   +2 more sources

A linear-time algorithm for semitotal domination in strongly chordal graphs

Discrete Applied Mathematics, 2021
Vikash Tripathi, Arti Pandey, A. Maheshwari   +2 more
semanticscholar   +1 more source

A good characterization of squares of strongly chordal split graphs

Information Processing Letters, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Le, Van Bang, Nguyen, Ngoc Tuy
openaire   +2 more sources

Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs

1997
For a given ordered graph (G,
openaire   +1 more source

Knowledge Graphs

ACM Computing Surveys, 2022
Aidan Hogan, Claudio Gutierrez, Sabrina Kirrane   +2 more
exaly  

The AME 2020 atomic mass evaluation (II). Tables, graphs and references*

Chinese Physics C, 2021
Meng Wang, Filip Kondev, Sarah Naimi
exaly  

Use of directed acyclic graphs (DAGs) to identify confounders in applied health research: review and recommendations

International Journal of Epidemiology, 2021
Peter W G Tennant, Eleanor J Murray, Kellyn F Arnold   +2 more
exaly  

-labeling of dually chordal graphs and strongly orderable graphs

Information Processing Letters, 2012
B.S. Panda, Preeti Goel
openaire   +1 more source

Adversarial Attacks and Defenses in Images, Graphs and Text: A Review

International Journal of Automation and Computing, 2020
Han Xu, Anil K Jain
exaly  

Knowledge Graphs: Opportunities and Challenges

Artificial Intelligence Review, 2023
Feng Xia
exaly