Results 131 to 140 of about 1,930 (230)
Classes of bipartite graphs related to chordal graphs
Andreas Brandstädt
openalex +1 more source
Local medians in chordal graphs
AbstractThe median set of a graph G with weighted vertices consists of those vertices that minimized the total distance sum. If the distance sum of a vertex is locally minimal, i.e., with respect to the neighbours of ν, then ν is called a local median.
openaire +2 more sources
Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
Dieter Kratsch
openalex +1 more source
An introduction to chordal graphs and clique trees
Jean R. S. Blair, Barry W. Peyton
openalex +2 more sources
Automated design of dynamic programming schemes for RNA folding with pseudoknots. [PDF]
Marchand B+4 more
europepmc +1 more source
ChoCo: a Chord Corpus and a Data Transformation Workflow for Musical Harmony Knowledge Graphs. [PDF]
de Berardinis J+3 more
europepmc +1 more source