Results 41 to 50 of about 412 (107)

An FPT Algorithm for Directed Co-Graph Edge Deletion

open access: yesAlgorithms
In the directed co-graph edge-deletion problem, we are given a directed graph and an integer k, and the question is whether we can delete, at most, k edges so that the resulting graph is a directed co-graph. In this paper, we make two minor contributions.
Wenjun Li   +3 more
doaj   +1 more source

$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses [PDF]

open access: green, 2022
Fernando Esteban Contreras-Mendoza   +1 more
openalex   +1 more source

Forbidden subgraphs of TI-power graphs of finite groups

open access: yesOpen Mathematics
Given a finite group GG with identity ee, the TI-power graph (trivial intersection power graph) defined on GG, denoted by Γ(G)\Gamma \left(G), is an undirected graph with vertex set GG where distinct vertices aa and bb are adjacent if ⟨a⟩∩⟨b⟩={e}\langle ...
Li Huani, Chen Jin, Lin Shixun
doaj   +1 more source

Graph-Based Feature Crossing to Enhance Recommender Systems

open access: yesMathematics
In recommendation tasks, most existing models that learn users’ preferences from user–item interactions ignore the relationships between items. Additionally, ensuring that the crossed features capture both global graph structures and local context is non-
Congyu Cai   +5 more
doaj   +1 more source

Indirect identification of horizontal gene transfer. [PDF]

open access: yesJ Math Biol, 2021
Schaller D   +4 more
europepmc   +1 more source

Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs. [PDF]

open access: yesJ Math Biol, 2021
Schaller D   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy