Results 281 to 290 of about 157,845 (305)
Some of the next articles are maybe not open access.

Characterizing interval graphs which are probe unit interval graphs

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

Chordal graphs, interval graphs, and wqo

Journal of Graph Theory, 1998
Let \(\preceq\) be the induced-minor relation. It is shown that, for every \(t\), all chordal graphs of clique number at most \(t\) are well-quasi-ordered by \(\preceq\). On the other hand, if the bound on the clique number is dropped, even the class of interval graphs is not well-quasi-ordered by \(\preceq\).
openaire   +2 more sources

Listing Chordal Graphs and Interval Graphs

2006
We propose three algorithms for enumeration problems; given a graph G, to find every chordal supergraph (in Kn) of G, to find every interval supergraph (in Kn) of G, and to find every interval subgraph of G in Kn. The algorithms are based on the reverse search method.
Masashi Kiyomi   +2 more
openaire   +1 more source

Variations on interval graphs

2001
A bipartite graph with partitions \(P\) and \(C\) is called an interval bigraph, if there exists a family of intervals which associates each vertex of \(G=(V, E)\) with an interval, and for \(x,y \in V\) the edge between \(x\) and \(y\) is in \(E\) if the corresponding intervals intersect and at least one of \(x\) and \(y\) is in \(P\). After a lengthy
Brown, David E.   +2 more
openaire   +1 more source

Knowledge Graphs

ACM Computing Surveys, 2022
Aidan Hogan   +2 more
exaly  

Knowledge Graphs: Opportunities and Challenges

Artificial Intelligence Review, 2023
Ciyuan Peng   +2 more
exaly  

A Survey on Embedding Dynamic Graphs

ACM Computing Surveys, 2023
Matheus R F Mendonça   +2 more
exaly  

Community detection in graphs

Physics Reports, 2010
Santo Fortunato
exaly  

Home - About - Disclaimer - Privacy