Results 51 to 60 of about 655,680 (212)
Chordal Graph Models of Contingency Tables
Chordal graph theory has recently found application by statisticians in the analysis of contingency tables. Specifically, what are called \u27\u27decomposable loglinear models\u27\u27 correspond exactly to chordal graphs.
Khamis, Harry J., McKee, Terry A.
core +1 more source
A hole in a graph is an induced subgraph which is a cycle of length at least four. A graph is chordal if it contains no holes. Following McKee and Scheinerman (1993), we define the chordality of a graph $G$ to be the minimum number of chordal graphs on $V(G)$ such that the intersection of their edge sets is equal to $E(G)$.
Aristotelis Chaniotis +2 more
openaire +3 more sources
Transitivity on Subclasses of Chordal Graphs
Let $G=(V, E)$ be a graph, where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say $A$ \textit{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$ in $G$. A vertex partition $π= \{V_1, V_2, \ldots, V_k\}$ of $G$ is called a \emph{transitive $k$-partition} if $V_i ...
Subhabrata Paul, Kamal Santra
openaire +2 more sources
Chordal Graphs as Intersection Graphs of Pseudosegments
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. The main contribution is a construction which shows that all chordal graphs which have a representation as intersection graph of subpaths on a tree are ...
Felsner, Stefan, Dangelmayr, Cornelia
core +1 more source
The complexity of two graph orientation problems [PDF]
This is the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 ElsevierWe consider two orientation problems in a graph, namely the minimization of the sum of all the shortest path ...
Noble, SD +5 more
core +1 more source
Graph Decompositions and Factorizing Permutations [PDF]
A factorizing permutation of a given graph is simply a permutation of the vertices in which all decomposition sets appear to be factors. Such a concept seems to play a central role in recent papers dealing with graph decomposition. It is applied here for
Christian Capelle +2 more
doaj +3 more sources
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
We introduce a notion of simultaneity for any class of graphs with an intersection representation (interval graphs, chordal graphs, etc.) and for comparability graphs, which are represented by transitive orientations.
Krishnam Raju Jampani, Anna Lubiw
doaj +1 more source
ProMetNet introduces a biologically constrained deep learning framework for proteo‐metabolomic integration by embedding Reactome‐derived pathway topology into neural networks. It captures non‐linear molecular dependencies and pathway‐level metabolic reorganization, enabling interpretable discrimination.
Minghui Zhao +6 more
wiley +1 more source
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs [PDF]
A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that $G-M$ is acyclic. Deciding whether $G$ is matching-decyclable is an NP-complete problem even if $G$ is 2-connected, planar, and subcubic.
Fábio Protti, Uéverton S. Souza
doaj +1 more source
On the pathwidth of chordal graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources

