Results 101 to 110 of about 4,343 (225)
Радіоелектронні і комп'ютерні системиThe subject matter of the article is the efficiency analysis of greedy optimization algorithms for subset selection in distributed systems under delta-matroid constraints.
Inessa Kulakovska
doaj +1 more source
, 2022 This chapter introduces matroids, gives several basic examples of them, describes the fundamental constructions for matroids. and defines the Tutte polynomial for matroids. • The matroid theory conventions throughout the handbook. • Circuits, independent
Oxley, James
core +1 more source
Generic root counts and flatness in tropical geometry
Journal of the London Mathematical Society, Volume 111, Issue 5, May 2025.Abstract We use tropical and nonarchimedean geometry to study the generic number of solutions of families of polynomial equations over a parameter space Y$Y$. In particular, we are interested in the choices of parameters for which the generic root count is attained.
Paul Alexander Helminck, Yue Ren
wiley +1 more source
, 2008 The operation of matroid union was introduced by Nash-Williams in 1966. A matroid is indecomposable if it cannot be written in the form M = M1 V M2, where r(M1),r(M2) > 0. In 1971 Welsh posed the problem of characterizing indecomposable matroids, this
Ali M. Hameed (12207488)
core +1 more source
Efficient and strategy‐proof mechanism under general constraints
Theoretical Economics, Volume 20, Issue 2, Page 481-509, May 2025.This study investigates efficient and strategy‐proof mechanisms for allocating indivisible goods under constraints. First, we examine a setting without endowments. In this setting, we introduce a class of constraints—ordered accessibility—for which the serial dictatorship (SD) mechanism is Pareto‐efficient (PE), individually rational (IR), and group ...
Kenzo Imamura, Yasushi Kawase
wiley +1 more source
Power graphs and exchange property for resolving sets
Open Mathematics, 2019 Classical applications of resolving sets and metric dimension can be observed in robot navigation, networking and pharmacy. In the present article, a formula for computing the metric dimension of a simple graph wihtout singleton twins is given.
Abbas Ghulam +4 more
doaj +1 more source
New building blocks for F1${\mathbb {F}}_1$‐geometry: Bands and band schemes
Journal of the London Mathematical Society, Volume 111, Issue 4, April 2025.Abstract We develop and study a generalization of commutative rings called bands, along with the corresponding geometric theory of band schemes. Bands generalize both hyperrings, in the sense of Krasner, and partial fields in the sense of Semple and Whittle.
Matthew Baker +2 more
wiley +1 more source
Basilica: New canonical decomposition in matching theory
Journal of Graph Theory, Volume 108, Issue 3, Page 508-542, March 2025.Abstract In matching theory, one of the most fundamental and classical branches of combinatorics, canonical decompositions of graphs are powerful and versatile tools that form the basis of this theory. However, the abilities of the known canonical decompositions, that is, the Dulmage–Mendelsohn, Kotzig–Lovász, and Gallai–Edmonds decompositions, are ...
Nanao Kita
wiley +1 more source
On cographic matroids and signed-graphic matroids
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Naval Research Logistics (NRL), Volume 72, Issue 1, Page 133-147, February 2025.Abstract A classic result of Korte and Hausmann [1978] and Jenkyns [1976] bounds the quality of the greedy solution to the problem of finding a maximum value basis of an independence system (E,ℐ)$$ \left(E,\mathcal{I}\right) $$ in terms of the rank‐quotient. We extend this result in two ways.
Sven de Vries +2 more
wiley +1 more source