Results 91 to 100 of about 6,109 (206)

Prediction of Shooting Events in Soccer Videos Using Complete Bipartite Graphs and Players' Spatial-Temporal Relations. [PDF]

Sensors (Basel), 2023
Goka R, Moroto Y, Maeda K, Ogawa T, Haseyama M.   +4 more
europepmc   +1 more source

Generation of Gray Codes Through the Rough Identity–Summand Graph of Filters of A Rough bi–Heyting Algebra

International Journal of Applied Mathematics and Computer Science
This paper introduces the concept of filters in a rough bi-Heyting algebra. The rough bi-Heyting algebra defined through the rough semiring offers interesting properties.
Praba Bashyam, Freeda Lourdusamy Packiammal Anto   +1 more
doaj   +1 more source

Problem Definition and Optimization Method for Bipartite Graph Scheduling

IEEE Access
Bipartite graphs can describe various systems in real world. In this study, we define a new problem class for optimizing the cost or profit associated with state changes in systems represented by bipartite graphs and propose a heuristic approach based on
Hiroshi Ikeda, Tatsuya Takanaga
doaj   +1 more source

Recoloring via Modular Decomposition

Journal of Graph Theory, Volume 111, Issue 4, Page 113-123, April 2026.
ABSTRACT The reconfiguration graph of the k‐colorings of a graph G, denoted R k ( G ), is the graph whose vertices are the k‐colorings of G and two colorings are adjacent in R k ( G ) if they differ in color on exactly one vertex. A graph G is said to be recolorable if R ℓ ( G ) is connected for all ℓ ≥ χ ( G ) + 1.
Manoj Belavadi, Kathie Cameron, Ni Luh Dewi Sintiari   +2 more
wiley   +1 more source

Recognizing Graphs Close to Bipartite Graphs

, 2017
We continue research into a well-studied family of problems that ask if the vertices of a graph can be partitioned into sets A and B, where A is an independent set and B induces a graph from some specified graph class G. We let G be the class of k-degenerate graphs.
Bonamy, Marthe, Dabrowski, Konrad K., Feghali, Carl, Johnson, Matthew, Paulusma, Daniël   +4 more
openaire   +4 more sources

Tractable but Hard to Approximate: The Bi‐Objective Minimum s$$ s $$‐t$$ t $$‐Cut Problem With Binary Capacities

Networks, Volume 87, Issue 3, Page 312-321, April 2026.
ABSTRACT The minimum s$$ s $$‐t$$ t $$‐cut problem is one of the most‐studied problems in discrete optimization and has a unique complexity status in multi‐objective optimization. Even though the single‐objective version of the problem can be solved in polynomial time, it has been shown in the seminal work of Papadimitriou and Yannakakis (2000) that ...
Jan Boeckmann, Stephan Helfrich, Oliver Bachtler, Stefan Ruzika, Clemens Thielen   +4 more
wiley   +1 more source

Martingales and the characteristic functions of absorption time on bipartite graphs. [PDF]

R Soc Open Sci, 2021
Monk T, van Schaik A.
europepmc   +1 more source

Artificial intelligence streamlines scientific discovery of drug–target interactions

British Journal of Pharmacology, Volume 183, Issue 8, Page 1673-1690, April 2026.
Abstract Drug discovery is a complicated process through which new therapeutics are identified to prevent and treat specific diseases. Identification of drug–target interactions (DTIs) stands as a pivotal aspect within the realm of drug discovery and development. The traditional process of drug discovery, especially identification of DTIs, is marked by
Yuxin Yang, Feixiong Cheng
wiley   +1 more source

The dual problems of coordination and anti-coordination on random bipartite graphs. [PDF]

New J Phys, 2021
Jones MI, Pauls SD, Fu F.
europepmc   +1 more source

Star-path and star-stripe bipartite Ramsey numbers in multicoloring [PDF]

Transactions on Combinatorics, 2015
‎For given bipartite graphs G 1 ‎,‎G 2 ,…‎,‎G t , the bipartite Ramsey number bR(G 1 ‎,‎G 2 ,…‎,‎G t ) is the‎ ‎smallest integer n such that if the edges of the complete bipartite graph K n,n are partitioned into t disjoint color classes giving t ...
Ghaffar Raeisi
doaj