Results 31 to 40 of about 359,135 (290)
Pairwise Stability in Two Sided Market with Strictly Increasing Valuation Functions [PDF]
This paper deals with two-sided matching market with two disjoint sets, i.e. the set of buyers and the set of sellers. Each seller can trade with at most with one buyer and vice versa.
Yasir Ali, Asma Javaid
doaj +1 more source
Optimizing tree decompositions in MSO [PDF]
The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves the following problem in linear fixed-parameter time: given a tree decomposition of a graph of (possibly suboptimal) width k, compute an optimum-width tree decomposition of the ...
Mikołaj Bojańczyk, Michał Pilipczuk
doaj +1 more source
Enterprise Integration & API Economy
Mr. Ovais Khan in Seminar Series \u27Enterprise Integration & API Economy\u27 organized by IBA, School of Mathematics and Computer Science (SMCS) on 24th March 2022.https://ir.iba.edu.pk/training-events-gallery/1053/thumbnail ...
School of Mathematics and Computer Science (SMCS)
core +4 more sources
On complete classes of valuated matroids [PDF]
We characterize a rich class of valuated matroids, called R-minor valuated matroids that includes the indicator functions of matroids, and is closed under operations such as taking minors, duality, and induction by network.
Edin Husić +3 more
doaj +1 more source
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability [PDF]
We show that feasibility of the $t^\text{th}$ level of the Lasserre semidefinite programming hierarchy for graph isomorphism can be expressed as a homomorphism indistinguishability relation.
David E. Roberson, Tim Seppelt
doaj +1 more source
Introduction: the article describes the application of fuzzy logic in the teaching of mathematics. This theory has a great creative ability to solve various pedagogical tasks for the implementation of the developing and applied functions of school ...
Mikhail A. Rodionov +2 more
doaj +1 more source
Stable gonality is computable [PDF]
Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the minimum number
Ragnar Groot Koerkamp +1 more
doaj +1 more source
In memoriam of Yurii Rogozhin [PDF]
November 13, 2019 would be the 70th birthday of Prof. Yurii Rogozhin. Dr. hab.~Yurii Rogozhin (November 13, 1949 $\dagger$ March 10, 2014) was a worldwide known computer scientist with diverse interests, ranged from finding small universal Turing ...
The staff of the Vladimir Andrunachievici Institute of Mathematics and Computer Science
doaj
An Alternate Proof of Near-Optimal Light Spanners [PDF]
In 2016, a breakthrough result of Chechik and Wulff-Nilsen [SODA '16] established that every $n$-node graph $G$ has a $(1+\varepsilon)(2k-1)$-spanner of lightness $O_{\varepsilon}(n^{1/k})$, and recent followup work by Le and Solomon [STOC '23 ...
Greg Bodwin
doaj +1 more source
Some aspects of the process of mathematical modeling and computational experiment are considered. The modeling process is considered as a method of predicting the behavior of dynamic systems and processes, which allows implementing a chain from a full ...
Sergey Strebulyaev, Daria Sirotkina
doaj +1 more source

