نتائج البحث

Transversals of longest cycles in partial k‐trees and chordal graphs

• Authors : Juan Gutiérrez

Subjects: Treewidth; Combinatorics; Transversal (geometry)

• Source: Journal of Graph Theory. 98:589-603

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

The Parameterized Complexity of the Minimum Shared Edges Problem ...

• Authors : Fluschnik, Till; Kratsch, Stefan; Niedermeier, Rolf

Subjects: Parameterized complexity; kernelization; treewidth

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

A Parameterized Complexity View on Collapsing k-Cores

• Authors : Hendrik Molter; Ondřej Suchý; Junjie Luo

Subjects: Degree (graph theory); Computational complexity theory; Induced subgraph

• Source: Theory of Computing Systems. 65:1243-1282

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

Intersection Dimension and Graph Invariants

• Authors : N. R. Aravind; C. R. Subramanian

Subjects: Applied Mathematics; Dimension (graph theory); dimensional properties

• Source: Discussiones Mathematicae Graph Theory, Vol 41, Iss 1, Pp 153-166 (2021)

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

Threshold Treewidth and Hypertree Width

• Authors : Manuel Sorge; Robert Ganian; Stefan Szeider

Subjects: FOS: Computer and information sciences; Computer Science - Artificial Intelligence; 0102 computer and information sciences

• Source: Journal of Artificial Intelligence ResearchProceedings of the Twenty-Ninth International Joint Conference on Artificial IntelligenceIJCAI

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

Toughness and spanning trees in K4‐minor‐free graphs

• Authors : Songling Shan; Dong Ye; Xiaoya Zha

Subjects: Combinatorics; Treewidth; Toughness

• Source: Journal of Graph Theory. 96:379-402

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

Treewidth is a lower bound on graph gonality

• Authors : Josse van Dobben de Bruyn; Dion Gijswijt

Subjects: Mathematics::Commutative Algebra; business.industry; Treewidth

• Source: Algebraic Combinatorics, 3(4)

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

Maximum matching width: New characterizations and a fast algorithm for dominating set

• Authors : Sigve Hortemo Sæther; Jisu Jeong; Jan Arne Telle

Subjects: FOS: Computer and information sciences; Discrete Mathematics (cs.DM); 05C85, 68R10

• Source: Leibniz International Proceedings in Informatics

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

(Meta) Kernelization

• Authors : Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel ...

Subjects: Graph algorithms; counting monadic second order logic; Parameterized complexity

• Source: ISSN: 0004-5411.

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

Parameterized complexity dichotomy for Steiner multicut

• Authors : Bringmann, Karl; Hermelin, Danny; Mnich, Matthias

Subjects: Cut problems; Steiner multicut; Parameterized complexity

• Source: Bringmann , K , Hermelin , D , Mnich , M & van Leeuwen , E J 2016 , ' Parameterized complexity dichotomy for Steiner multicut ' , Journal of Computer and System Sciences , vol. 82 , no. 6 , pp.

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