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

Computing the fully optimal spanning tree of an ordered bipolar directed graph

Subjects: Bipolar directed graph; Spanning tree; Computational complexity

  • Source: ISSN: 0012-365X ; Discrete Mathematics ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449 ; Discrete Mathematics, 2024, 347 (5),

Record details

×
Academic Journal

Computing the fully optimal spanning tree of an ordered bipolar directed graph

Subjects: Bipolar directed graph; Spanning tree; Computational complexity

  • Source: ISSN: 0012-365X ; Discrete Mathematics ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04387449 ; Discrete Mathematics, In press.

Record details

×
Academic Journal

FPT algorithms for packing k-safe spanning rooted sub(di)graphs

Subjects: Digraphs; Packing problems; Arborescences

  • Source: ISSN: 0166-218X ; Discrete Applied Mathematics ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04352990 ; Discrete Applied Mathematics, 2024,

Record details

×
Conference

Kernelization for Graph Packing Problems via Rainbow Matching

Subjects: Kernelization; Parameterized algorithms; Rainbow matchingFlorence; ItalyFlorence, Italy

  • Source: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ; SODA 2023 - ACM-SIAM Symposium on Discrete Algorithms ; https://hal.science/hal-04042995 ; SODA 2023 - ACM-SIAM

Record details

×
Conference

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes

Subjects: Algorithmic meta-theorems; Model-checking; First-order logicFlorence; ItalyFlorence, Italy

  • Source: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ; SODA 2023 - ACM-SIAM Symposium on Discrete Algorithms ; https://hal.science/hal-04043007 ; SODA 2023 - ACM-SIAM

Record details

×
  • 1-10 of  783 results for ""Mathematics""