標(biāo)題: Titlebook: Building Bridges II; Mathematics of Lászl Imre Bárány,Gyula O. H. Katona,Attila Sali Book 2019 J?nos Bolyai Mathematical Society and Sprin [打印本頁] 作者: 即將過時(shí) 時(shí)間: 2025-3-21 17:29
書目名稱Building Bridges II影響因子(影響力)
書目名稱Building Bridges II影響因子(影響力)學(xué)科排名
書目名稱Building Bridges II網(wǎng)絡(luò)公開度
書目名稱Building Bridges II網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Building Bridges II被引頻次
書目名稱Building Bridges II被引頻次學(xué)科排名
書目名稱Building Bridges II年度引用
書目名稱Building Bridges II年度引用學(xué)科排名
書目名稱Building Bridges II讀者反饋
書目名稱Building Bridges II讀者反饋學(xué)科排名
作者: ingenue 時(shí)間: 2025-3-21 21:08 作者: Corroborate 時(shí)間: 2025-3-22 03:20
Identifiability for Graphexes and the Weak Kernel Metric,aphexes over .-finite measure spaces has been introduced. In this paper, we introduce a metric for graphexes that generalizes the cut metric for the graphons of the dense theory of graph convergence. We show that a sequence of graphexes converges in this metric if and only if the sequence of graph p作者: Ceramic 時(shí)間: 2025-3-22 06:19
Online Ramsey Numbers and the Subgraph Query Problem,ilder draws an edge on each turn and Painter immediately paints it red or blue. Builder’s goal is to force Painter to create either a red . or a blue . using as few turns as possible. The online Ramsey number . is the minimum number of edges Builder needs to guarantee a win in the (.,?.)-online Rams作者: cultivated 時(shí)間: 2025-3-22 08:54 作者: Obvious 時(shí)間: 2025-3-22 14:03 作者: 招人嫉妒 時(shí)間: 2025-3-22 18:47 作者: 新娘 時(shí)間: 2025-3-22 21:33
Minimum Cost Globally Rigid Subgraphs, the points corresponding to its end-vertices. The framework is said to be globally rigid if its edge lengths uniquely determine all pairwise distances in the framework. A graph . is called globally rigid in . if every generic .-dimensional framework (.,?.) is globally rigid. Global rigidity has app作者: preservative 時(shí)間: 2025-3-23 03:34
Coloured and Directed Designs,ypergraphs with coloured or directed edges. For example, we give fairly general conditions for decomposing an edge-coloured graph into rainbow triangles, and for decomposing an .-digraph into tight .-cycles.作者: instulate 時(shí)間: 2025-3-23 08:10
Efficient Convex Optimization with Oracles,n is given by an evaluation oracle and the set by a membership oracle. The algorithm takes . oracle calls and . additional arithmetic operations. This results in more efficient reductions among the five basic oracles for convex sets and functions defined by Gr?tschel, Lovász and Schrijver (Algorithm作者: 急急忙忙 時(shí)間: 2025-3-23 13:17
Approximations of Mappings,roximating a continuous mapping by a finite mapping. This problem is the inverse problem of the construction of a continuous limit for first-order convergent sequences of finite mappings. We solve the approximation problem and, consequently, the full characterization of limit objects for mappings fo作者: 長(zhǎng)處 時(shí)間: 2025-3-23 15:42
Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization,are polynomials over a field). This class was introduced, in a different language, by Lovász?[.] in his study of flats in matroids, and proved a duality theorem putting this problem in .. As such, our result is another demonstration where “good characterization” in the sense of Edmonds leads to an e作者: Left-Atrium 時(shí)間: 2025-3-23 19:08 作者: GRIEF 時(shí)間: 2025-3-24 01:26
Embedding Graphs into Larger Graphs: Results, Methods, and Problems,e select some of those results which either we feel very important in this field or which are . results, or which—for some other reasons—are very close to us. Some results discussed here got stronger emphasis, since they are connected to Lovász (and sometimes to us).作者: 尊敬 時(shí)間: 2025-3-24 05:31
Imre Bárány,Gyula O. H. Katona,Attila SaliIncludes 14 contributions of leading researchers in the fields of combinatorics and computer science.Builds bridges between discrete and continuous mathematics.Includes open problems in various connec作者: MOAT 時(shí)間: 2025-3-24 07:17
Bolyai Society Mathematical Studieshttp://image.papertrans.cn/b/image/191591.jpg作者: 男生戴手銬 時(shí)間: 2025-3-24 10:39
https://doi.org/10.1007/978-3-662-59204-5discrete mathematics; theoretical computer science; graph theory; codes; desgins; graph limits; combinator作者: 內(nèi)閣 時(shí)間: 2025-3-24 17:30 作者: Ostrich 時(shí)間: 2025-3-24 22:31
Building Bridges II978-3-662-59204-5Series ISSN 1217-4696 Series E-ISSN 2947-9460 作者: forestry 時(shí)間: 2025-3-25 00:51
Akshay Mohan Pujar,Chetan Kulkarnitheoretic results like Schrijver’s theorem on the number of perfect matchings of regular bipartite graphs and its variants from the point of view of graph limit theory. We also study the number of matchings of finite and infinite vertex-transitive graphs.作者: Lymphocyte 時(shí)間: 2025-3-25 05:11
Advanced Polymers in Aircraft Structures,practice but has eluded analysis. This paper offers examples where the analysis can be carried out and the first general bounds for the sample size required. This uses a novel importance sampling proof of Brégman’s inequality due to Lovász.作者: RENAL 時(shí)間: 2025-3-25 10:15
Roman Koz?owski,David Hughes,Johannes Weberypergraphs with coloured or directed edges. For example, we give fairly general conditions for decomposing an edge-coloured graph into rainbow triangles, and for decomposing an .-digraph into tight .-cycles.作者: arousal 時(shí)間: 2025-3-25 14:33 作者: 貝雷帽 時(shí)間: 2025-3-25 16:23
Die Theorie der einfachen Stoffe show that for fixed ., this problem is solvable in polynomial time if the directed graph is planar. More generally, the problem is solvable in polynomial time for directed graphs embedded on a fixed compact surface. Moreover, one may specify for each edge a subset of . prescribing which of the . paths are allowed to traverse this edge.作者: 博識(shí) 時(shí)間: 2025-3-25 23:48 作者: dithiolethione 時(shí)間: 2025-3-26 01:21 作者: 音樂會(huì) 時(shí)間: 2025-3-26 04:18
A. Ajithram,J. T. Winowlin Jappes,I. Siva make it possible to pass to the limit of a class of finite matroids. With the current flurry of interest in limits of combinatorial objects, a review of such matroid limits seems timely. The characteristic property of a continuous matroid is the existence of a rank function taking as values the ful作者: 鉆孔 時(shí)間: 2025-3-26 08:38
S. Sivasankaran,M. J. Kishor Kumaraphexes over .-finite measure spaces has been introduced. In this paper, we introduce a metric for graphexes that generalizes the cut metric for the graphons of the dense theory of graph convergence. We show that a sequence of graphexes converges in this metric if and only if the sequence of graph p作者: 一罵死割除 時(shí)間: 2025-3-26 15:34 作者: 使絕緣 時(shí)間: 2025-3-26 16:57
Akshay Mohan Pujar,Chetan Kulkarnitheoretic results like Schrijver’s theorem on the number of perfect matchings of regular bipartite graphs and its variants from the point of view of graph limit theory. We also study the number of matchings of finite and infinite vertex-transitive graphs.作者: 大喘氣 時(shí)間: 2025-3-26 23:26 作者: 匯總 時(shí)間: 2025-3-27 04:51
Major Units and Systems in Aircraft, known that the . randomized algorithm matches at least . edges in expectation. It is also known that no online algorithm matches more than . edges in expectation, when the input is chosen from a certain distribution that we refer to as .. This upper bound also applies to . matchings. We review the 作者: 專心 時(shí)間: 2025-3-27 06:08 作者: 終端 時(shí)間: 2025-3-27 10:01
Roman Koz?owski,David Hughes,Johannes Weberypergraphs with coloured or directed edges. For example, we give fairly general conditions for decomposing an edge-coloured graph into rainbow triangles, and for decomposing an .-digraph into tight .-cycles.作者: 匍匐前進(jìn) 時(shí)間: 2025-3-27 17:25
Mariola Marsza?ek,Andrzej Skowrońskin is given by an evaluation oracle and the set by a membership oracle. The algorithm takes . oracle calls and . additional arithmetic operations. This results in more efficient reductions among the five basic oracles for convex sets and functions defined by Gr?tschel, Lovász and Schrijver (Algorithm作者: 誘導(dǎo) 時(shí)間: 2025-3-27 19:42 作者: observatory 時(shí)間: 2025-3-27 22:59
https://doi.org/10.1007/978-3-642-82512-5are polynomials over a field). This class was introduced, in a different language, by Lovász?[.] in his study of flats in matroids, and proved a duality theorem putting this problem in .. As such, our result is another demonstration where “good characterization” in the sense of Edmonds leads to an e作者: 動(dòng)作謎 時(shí)間: 2025-3-28 02:32 作者: 會(huì)犯錯(cuò)誤 時(shí)間: 2025-3-28 06:38
Besonderheiten realer Materialiene select some of those results which either we feel very important in this field or which are . results, or which—for some other reasons—are very close to us. Some results discussed here got stronger emphasis, since they are connected to Lovász (and sometimes to us).作者: figment 時(shí)間: 2025-3-28 11:18 作者: HARD 時(shí)間: 2025-3-28 15:51
Sequential Importance Sampling for Estimating the Number of Perfect Matchings in Bipartite Graphs: practice but has eluded analysis. This paper offers examples where the analysis can be carried out and the first general bounds for the sample size required. This uses a novel importance sampling proof of Brégman’s inequality due to Lovász.作者: 古文字學(xué) 時(shí)間: 2025-3-28 18:53
Coloured and Directed Designs,ypergraphs with coloured or directed edges. For example, we give fairly general conditions for decomposing an edge-coloured graph into rainbow triangles, and for decomposing an .-digraph into tight .-cycles.作者: uncertain 時(shí)間: 2025-3-28 23:41
Efficient Convex Optimization with Oracles,n is given by an evaluation oracle and the set by a membership oracle. The algorithm takes . oracle calls and . additional arithmetic operations. This results in more efficient reductions among the five basic oracles for convex sets and functions defined by Gr?tschel, Lovász and Schrijver (Algorithms Comb 2, (1988), [.]).作者: 假裝是你 時(shí)間: 2025-3-29 05:15
Finding , Partially Disjoint Paths in a Directed Planar Graph, show that for fixed ., this problem is solvable in polynomial time if the directed graph is planar. More generally, the problem is solvable in polynomial time for directed graphs embedded on a fixed compact surface. Moreover, one may specify for each edge a subset of . prescribing which of the . paths are allowed to traverse this edge.作者: squander 時(shí)間: 2025-3-29 09:10 作者: deforestation 時(shí)間: 2025-3-29 13:13 作者: 反話 時(shí)間: 2025-3-29 17:00 作者: epicondylitis 時(shí)間: 2025-3-29 22:59 作者: 有其法作用 時(shí)間: 2025-3-30 02:42 作者: 擴(kuò)大 時(shí)間: 2025-3-30 07:39 作者: institute 時(shí)間: 2025-3-30 11:43
Identifiability for Graphexes and the Weak Kernel Metric, graphexes are precompact under our metric. Finally, we establish an identifiability theorem, characterizing when two graphexes are equivalent in the sense that they lead to the same process of random graphs.作者: 食物 時(shí)間: 2025-3-30 15:18
Approximations of Mappings,ike Aldous–Lyons conjecture) and a strengthening of the classical decidability result for finite satisfiability in Rabin class (which consists of first-order logic with equality, one unary function, and an arbitrary number of monadic predicates). The proof involves model theory and analytic techniques.作者: GRIN 時(shí)間: 2025-3-30 18:23
Major Units and Systems in Aircraft,s the expected cardinality of the (integral) matching produced by . when the input graph comes from the support of .. This expectation turns out to be ., and serves as an upper bound on the performance ratio of any online (integral) matching algorithm.作者: 審問 時(shí)間: 2025-3-30 22:27
