Second kind maximum matching graph
نویسندگان
چکیده
منابع مشابه
Maximum Stirling Numbers of the Second Kind
Say an integer n is exceptional if the maximum Stirling number of the second kind S(n, k) occurs for two (of necessity consecutive) values of k. We prove that the number of exceptional integers less than or equal to x is O(x), for any ! > 0. We derive a similar result for partitions of n into exactly k integers.
متن کاملCommunication Complexity of Approximate Maximum Matching in Distributed Graph Data
We consider the problem of computing an approximate maximum matching in a graph that consists of n vertices whose edges are stored across k distributed sites in a data center. We are interested in characterizing the communication complexity of this problem which is of primary concern in data centers where communication bandwidth is a scarce resource. Our main result is that any algorithm that f...
متن کاملOn Estimating Maximum Matching Size in Graph Streams
We study the problem of estimating the maximum matching size in graphs whose edges are revealed in a streaming manner. We consider both insertion-only streams, which only contain edge insertions, and dynamic streams that allow both insertions and deletions of the edges, and present new upper and lower bound results for both cases. On the upper bound front, we show that an αapproximate estimate ...
متن کاملConstruction of generalized pendulum equations with prescribed maximum number of limit cycles of the second kind
Consider a class of planar autonomous differential systems with cylindric phase space which represent generalized pendulum equations. We describe a method to construct such systems with prescribed maximum number of limit cycles which are not contractible to a point (limit cycles of the second kind). The underlying idea consists in employing Dulac-Cherkas functions. We also show how this approac...
متن کاملBounds on the location of the maximum Stirling numbers of the second kind
Let S(n, k) denote the Stirling number of the second kind, and let Kn be such that S(n,Kn − 1) < S(n,Kn) ≥ S(n,Kn + 1). Using a probabilistic argument, we show that, for all n ≥ 2, ⌊e⌋ − 2 ≤ Kn ≤ ⌊e ⌋+ 1, where ⌊x⌋ denotes the integer part of x, and w(n) denotes Lambert’s W function.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2014
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.01.011