Results 131 to 140 of about 3,632 (158)

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs

Journal of Combinatorial Optimization, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Panda, B. S., Pradhan, D.
openaire   +1 more source

Distance- $$d$$ independent set problems for bipartite and chordal graphs

Journal of Combinatorial Optimization, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eto, Hiroshi, Guo, Fengrui, Miyano, Eiji
openaire   +1 more source

On partial Grundy coloring of bipartite graphs and chordal graphs

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Panda, B. S., Verma, Shaily
openaire   +1 more source

A Min–Max Property of Chordal Bipartite Graphs with Applications

Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abueida, Atif, Busch, Arthur H., Sritharan, R.   +2 more
openaire   +2 more sources

Characterizing s-strongly chordal bipartite graphs

Utilitas Mathematica
<p>The strongly chordal graph literature has recently expanded to include the sequentially smaller classes of <span class="math inline">\(s\)</span>-strongly chordal graphs for <span class="math inline">\(s = 1, 2, 3,\ldots\)</span> (and the limiting class of majorly chordal graphs). These stronger classes preserve — while
openaire   +1 more source

Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes

2010
We provide polynomial-time algorithms for counting the number of perfect matchings in chain graphs, cochain graphs, and threshold graphs. These algorithms are based on newly developed subdivision schemes that we call a recursive decomposition. On the other hand, we show the $\sharp$ P-completeness for counting the number of perfect matchings in chordal
Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno   +2 more
openaire   +1 more source

Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs

2002
Chordal bipartite graphs are introduced to analyze nonsymmetric matrices, and form a large class of perfect graphs. There are several problems, which can be solved efficiently on the class using the characterization by the doubly lexical ordering ofthe bipartite adjacency matrix.
openaire   +1 more source

Knowledge Graphs

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

Knowledge Graphs: Opportunities and Challenges

Artificial Intelligence Review, 2023
Feng Xia
exaly  

Distinct Classes of Complex Structural Variation Uncovered across Thousands of Cancer Genome Graphs

Cell, 2020
Kevin Hadi, Xiaotong Yao, Aditya Deshpande   +2 more
exaly