↓ Skip to main content

Algorithms and Discrete Applied Mathematics

Overview of attention for book
Cover of 'Algorithms and Discrete Applied Mathematics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Efficient Domination and Efficient Edge Domination: A Brief Survey
  3. Altmetric Badge
    Chapter 2 Mixed Unit Interval Bigraphs
  4. Altmetric Badge
    Chapter 3 Hamiltonian Path in $$K_{1,t}$$ -free Split Graphs- A Dichotomy
  5. Altmetric Badge
    Chapter 4 A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems
  6. Altmetric Badge
    Chapter 5 Probabilistic Properties of Highly Connected Random Geometric Graphs
  7. Altmetric Badge
    Chapter 6 On Indicated Coloring of Some Classes of Graphs
  8. Altmetric Badge
    Chapter 7 Line Segment Disk Cover
  9. Altmetric Badge
    Chapter 8 Fixed-Parameter Tractable Algorithms for Tracking Set Problems
  10. Altmetric Badge
    Chapter 9 Exact Computation of the Number of Accepting Paths of an NTM
  11. Altmetric Badge
    Chapter 10 Determining Minimal Degree Polynomials of a Cyclic Code of Length $$2^k$$ over $$\mathbb {Z}_8$$
  12. Altmetric Badge
    Chapter 11 Consistent Subset Problem with Two Labels
  13. Altmetric Badge
    Chapter 12 The Edge Geodetic Number of Product Graphs
  14. Altmetric Badge
    Chapter 13 Burning Spiders
  15. Altmetric Badge
    Chapter 14 Drawing Graphs on Few Circles and Few Spheres
  16. Altmetric Badge
    Chapter 15 On a Lower Bound for the Eccentric Connectivity Index of Graphs
  17. Altmetric Badge
    Chapter 16 On the Tractability of ( k ,  i )-Coloring
  18. Altmetric Badge
    Chapter 17 Window Queries for Problems on Intersecting Objects and Maximal Points*
  19. Altmetric Badge
    Chapter 18 Bounded Stub Resolution for Some Maximal 1-Planar Graphs
  20. Altmetric Badge
    Chapter 19 On Structural Parameterizations of Firefighting
  21. Altmetric Badge
    Chapter 20 On the Simultaneous Minimum Spanning Trees Problem
  22. Altmetric Badge
    Chapter 21 Variations of Cops and Robbers Game on Grids
  23. Altmetric Badge
    Chapter 22 Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps
  24. Altmetric Badge
    Chapter 23 On Oriented L ( p , 1)-labeling
  25. Altmetric Badge
    Chapter 24 Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions
Attention for Chapter 20: On the Simultaneous Minimum Spanning Trees Problem
Altmetric Badge

Mentioned by

twitter
1 X user

Readers on

mendeley
4 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
On the Simultaneous Minimum Spanning Trees Problem
Chapter number 20
Book title
Algorithms and Discrete Applied Mathematics
Published by
Springer, Cham, February 2018
DOI 10.1007/978-3-319-74180-2_20
Book ISBNs
978-3-31-974179-6, 978-3-31-974180-2
Authors

Matěj Konečný, Stanislav Kučera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tětek, Martin Töpfer, Konečný, Matěj, Kučera, Stanislav, Novotná, Jana, Pekárek, Jakub, Smolík, Martin, Tětek, Jakub, Töpfer, Martin

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 2 50%
Student > Postgraduate 1 25%
Unknown 1 25%
Readers by discipline Count As %
Physics and Astronomy 2 50%
Computer Science 1 25%
Unknown 1 25%