Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

نتائج البحث

Display Settings
النتائج لكل صفحة: 10
Sort By: Relevance
Filter
  • 1-10 of  64,227 نتائج ل ""Discrete mathematics""

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

Content Provider : OpenAIRE Subject : combinatorics Subject : graphs Subject : teoria dos grafos فلترة بواسطة : موضوع
إعادة تعيين خيارات الفبترة
Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis

Subjects: FOS: Computer and information sciences; Vertex (graph theory); Class (set theory)

  • Source: IJCAI

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

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

Perfect forests in graphs and their extensions

Subjects: FOS: Computer and information sciences; graphs; Polynomial algorithms

  • Source: Gutin, G & Yeo, A 2021, Perfect Forests in Graphs and Their Extensions . in F Bonchi & S J Puglisi (eds), 46th International Symposium on Mathematical Foundations of

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

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

Planar L-Drawings of Bimodal Graphs

Subjects: Computational Geometry (cs.CG); FOS: Computer and information sciences; Vertex (graph theory)

  • Source: Lecture Notes in Computer Science ISBN: 9783030687656Graph DrawingMaastricht UniversityGraph Drawing and Network Visualization. GD 2020, 12590, 205-219Journal of Graph

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

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

Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs

Subjects: FOS: Computer and information sciences; Algebra and Number Theory; Current (mathematics)

  • Source: Fundamenta Informaticae. 182:257-283

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

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

Algorithmic Aspects of Secure Connected Domination in Graphs

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

  • Source: Discussiones Mathematicae Graph Theory, Vol 41, Iss 4, Pp 1179-1197 (2021)

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

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

Size Ramsey Results for the Path of Order Three

Subjects: Discrete mathematics; Combinatorics; Order (business)

  • Source: Graphs and Combinatorics. 37:2315-2331

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

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

Bounding the mim‐width of hereditary graph classes

Subjects: FOS: Computer and information sciences; Class (set theory); Discrete Mathematics (cs.DM)

  • Source: Journal of Graph Theory, 2022, Vol.99(1), pp.117-151 [Peer Reviewed Journal]Brettell, N, Horsfield, J, Munaro, A, Paesani, G & Paulusma, D 2020, Bounding the Mim-Width of Hereditary Graph

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

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

Kings in multipartite hypertournaments

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

  • Source: Journal of Graph Theory. 99:82-89

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

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

Equitable Vertex Arboricity Conjecture Holds for Graphs with Low Degeneracy

Subjects: FOS: Computer and information sciences; Vertex (graph theory); Class (set theory)

  • Source: Acta Mathematica Sinica, English Series. 37:1293-1302

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

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

Towards Uniform Online Spherical Tessellations

Subjects: Computational Geometry (cs.CG); FOS: Computer and information sciences; QA75

  • Source: Computing with Foresight and IndustryComputing with Foresight and Industry ISBN: 9783030229955CiEDiscrete and Computational Geometry: an international

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

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
×
  • 1-10 of  64,227 نتائج ل ""Discrete mathematics""