External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves

Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach. On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. In Marios Mavronicolas, editor, Algorithms and Complexity - 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings. Volume 13898 of Lecture Notes in Computer Science, pages 353-367, Springer, 2023. [doi]

Authors

Emmanuel Sam

This author has not been identified. Look up 'Emmanuel Sam' in Google

Michael R. Fellows

This author has not been identified. It may be one of the following persons: Look up 'Michael R. Fellows' in Google

Frances A. Rosamond

This author has not been identified. Look up 'Frances A. Rosamond' in Google

Petr A. Golovach

This author has not been identified. Look up 'Petr A. Golovach' in Google
runs on