Results 81 to 90 of about 3,632 (158)
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
de Figueiredo, C.M.H. +3 more
openaire +2 more sources
Quantum Advantages of Communication Complexity from Bell Nonlocality. [PDF]
Entropy (Basel), 2021 Jia ZA, Wei L, Wu YC, Guo GC.
europepmc +1 more source
Strengthening ties towards a highly-connected world. [PDF]
Data Min Knowl Discov, 2022 Matakos A, Gionis A.
europepmc +1 more source
Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility. [PDF]
Algorithms Mol Biol, 2020 Calamoneri T +4 more
europepmc +1 more source
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs
, 2018 Given a graph with colors on its vertices, a path is called a rainbow vertex path if all its internal vertices have distinct colors. We say that the graph is rainbow vertex-connected if there isa rainbow vertex path between every pair of its vertices. We study the problem of deciding whether the vertices of a given graph can be colored with at most k ...
Heggernes, Pinar +4 more
openaire +5 more sources
Encoding edge type information in graphlets. [PDF]
PLoS One, 2022 Jia M +5 more
europepmc +1 more source
Graph classes related to chordal graphs and chordal bipartite graphs
Electronic Notes in Discrete Mathematics, 2006 Ngoc Tuy Nguyen +2 more
openaire +1 more source
Graphlets in Multiplex Networks. [PDF]
Sci Rep, 2020 Dimitrova T, Petrovski K, Kocarev L.
europepmc +1 more source
Erratum to “Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs”
Discrete Mathematics, 2003 openaire +1 more source
Simplex polynomial in complex networks and its applications to compute the Euler characteristic. [PDF]
Front Comput NeurosciWang Z, Fu X, Deng B, Chen Y, Zhao H.
europepmc +1 more source