مكتبة

Item request has been placed!

Item request cannot be made.

Processing Request

Factorization and pseudofactorization of weighted graphs

Authors : Kristin Sheridan; Joseph Berleant; Mark Bathe

Subjects: FOS: Computer and information sciences; Discrete Mathematics (cs.DM); Applied Mathematics

Source: Discrete Applied Mathematics. 337:81-105

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

k-apices of minor-closed graph classes. I. Bounding the obstructions

Authors : Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos

Subjects: FOS: Computer and information sciences; Discrete Mathematics (cs.DM); 05C75, 05C83, 05C75, 05C69

Source: Journal of Combinatorial Theory, Series B. 161:180-227

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs

Authors : Rajesh Chitnis

Subjects: FOS: Computer and information sciences; Discrete Mathematics (cs.DM); General Mathematics

Source: SIAM Journal on Discrete Mathematics. 37:556-572

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Grid induced minor theorem for graphs of small degree

Authors : Tuukka Korhonen

Subjects: FOS: Computer and information sciences; Discrete Mathematics (cs.DM); Computational Theory and Mathematics

Source: Journal of Combinatorial Theory, Series B. 160:206-214

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

A note on the quickest minimum cost transshipment problem

Authors : Martin Skutella

Subjects: FOS: Computer and information sciences; Discrete Mathematics (cs.DM); Applied Mathematics

Source: Operations Research Letters. 51:255-258

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Combinatorial optimization problems with balanced regret

Authors : Marc Goerigk; Michael Hartisch

Subjects: FOS: Computer and information sciences; Discrete Mathematics (cs.DM); Optimization and Control (math.OC)

Source: Discrete Applied Mathematics. 328:40-59

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Enumeration of irredundant forests

Authors : Ingels, Florian; Azaïs, Romain;

Subjects: FOS: Computer and information sciences; Unordered Trees; Mathematics::Combinatorics

Source: Theoretical Computer ScienceTheoretical Computer Science, 2022, 922, pp.312-334. ⟨10.1016/j.tcs.2022.04.033⟩

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction

Authors : Kuikui Liu; Zongchen Chen; Eric Vigoda

Subjects: FOS: Computer and information sciences; Polynomial; Partition function (quantum field theory)

Source: FOCS

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

The complexity of gerrymandering over graphs: Paths and trees

Authors : Matthias Bentert; Tomohiro Koana; Rolf Niedermeier

Subjects: FOS: Computer and information sciences; Discrete Mathematics (cs.DM); Applied Mathematics

Source: Discrete Applied Mathematics. 324:103-112

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics

Authors : Chimani, Markus; Ilsen, Max; Wiedera, Tilo

Subjects: FOS: Computer and information sciences; Discrete Mathematics (cs.DM); General Computer Science

Source: Journal of Graph Algorithms and Applications. 27:71-94

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

نتائج البحث

فلترة النتائج

Factorization and pseudofactorization of weighted graphs

k-apices of minor-closed graph classes. I. Bounding the obstructions

A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs

Grid induced minor theorem for graphs of small degree

A note on the quickest minimum cost transshipment problem

Combinatorial optimization problems with balanced regret

Enumeration of irredundant forests

Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction

The complexity of gerrymandering over graphs: Paths and trees

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics

اتصل بنا

اتبع