How to see the forest despite the trees
Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley +1 more source
Efficient algorithm on exponential Wiener index and QSPR analysis of alkanes and benzenoid hydrocarbons. [PDF]
Punitha S, Kannan K, Menaga A.
europepmc +1 more source
Lower bounds for cube‐ideal set‐systems
Abstract A set‐system S⊆{0,1}n$S\subseteq \lbrace 0,1\rbrace ^n$ is cube‐ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential lower bounds on the size of cube‐ideal set‐systems, and linear lower bounds on their ...
Ahmad Abdi +3 more
wiley +1 more source
Builder-Blocker Mutual-Visibility Game. [PDF]
Chenoweth VI +4 more
europepmc +1 more source
Digitizing Micromaser Steady States: Entropy, Information Graphs, and Multipartite Correlations in Qubit Registers. [PDF]
Németh I, Zsóka S, Bencze A.
europepmc +1 more source
scDEBGCL: a deep embedding approach based on bipartite graph contrastive learning for single-cell RNA-seq data. [PDF]
Wang J +5 more
europepmc +1 more source
Decomposition of complete bipartite graphs into paths and cycles
S. Jeevadoss, A. Muthusamy
semanticscholar +1 more source
Observer-based prescribed-time lag bipartite consensus of nonlinear multi-agent systems under event-triggered mechanism. [PDF]
Tian J +5 more
europepmc +1 more source
Enumeration of Autocatalytic Subsystems in Large Chemical Reaction Networks. [PDF]
Golnik R +3 more
europepmc +1 more source
PAIR: Reconstructing Single-Cell Open-Chromatin Landscapes for Transcription Factor Regulome Mapping. [PDF]
Su Y +7 more
europepmc +1 more source

