↓ Skip to main content

Graphs States and the necessity of Euler Decomposition

Overview of attention for book
Cover of 'Graphs States and the necessity of Euler Decomposition'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 First-Order Universality for Real Programs
  3. Altmetric Badge
    Chapter 2 Skolem + Tetration Is Well-Ordered
  4. Altmetric Badge
    Chapter 3 Structures of Some Strong Reducibilities
  5. Altmetric Badge
    Chapter 4 Complexity of Existential Positive First-Order Logic
  6. Altmetric Badge
    Chapter 5 Stochastic Programs and Hybrid Automata for (Biological) Modeling
  7. Altmetric Badge
    Chapter 6 Numberings and randomness
  8. Altmetric Badge
    Chapter 7 The Strength of the Grätzer-Schmidt Theorem
  9. Altmetric Badge
    Chapter 8 Hyperloops Do Not Threaten the Notion of an Effective Procedure
  10. Altmetric Badge
    Chapter 9 Minimum Entropy Combinatorial Optimization Problems
  11. Altmetric Badge
    Chapter 10 Program Self-reference in Constructive Scott Subdomains
  12. Altmetric Badge
    Chapter 11 $\Sigma^0_1$ and $\Pi^0_1$ Equivalence Structures
  13. Altmetric Badge
    Chapter 12 Immunity for Closed Sets
  14. Altmetric Badge
    Chapter 13 Lower Bounds for Kernelizations and Other Preprocessing Procedures
  15. Altmetric Badge
    Chapter 14 Infinite-Time Turing Machines and Borel Reducibility
  16. Altmetric Badge
    Chapter 15 Cutting Planes and the Parameter Cutwidth
  17. Altmetric Badge
    Chapter 16 Members of Random Closed Sets
  18. Altmetric Badge
    Chapter 17 Lowness for Demuth Randomness
  19. Altmetric Badge
    Chapter 18 Graph States and the Necessity of Euler Decomposition
  20. Altmetric Badge
    Chapter 19 On Stateless Multicounter Machines
  21. Altmetric Badge
    Chapter 20 Computability of Continuous Solutions of Higher-Type Equations
  22. Altmetric Badge
    Chapter 21 Equivalence Relations on Classes of Computable Structures
  23. Altmetric Badge
    Chapter 22 Fractals Generated by Algorithmically Random Brownian Motion
  24. Altmetric Badge
    Chapter 23 Mathematical Theory and Computational Practice
  25. Altmetric Badge
    Chapter 24 Spectra of Algebraic Fields and Subfields
  26. Altmetric Badge
    Chapter 25 Definability in the Local Theory of the ω -Enumeration Degrees
  27. Altmetric Badge
    Chapter 26 Computability of Analytic Functions with Analytic Machines
  28. Altmetric Badge
    Chapter 27 An Application of Martin-Löf Randomness to Effective Probability Theory
  29. Altmetric Badge
    Chapter 28 Index Sets and Universal Numberings
  30. Altmetric Badge
    Chapter 29 Ordinal Computability
  31. Altmetric Badge
    Chapter 30 A Gandy Theorem for Abstract Structures and Applications to First-Order Definability
  32. Altmetric Badge
    Chapter 31 Constructing New Aperiodic Self-simulating Tile Sets
  33. Altmetric Badge
    Chapter 32 Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem
  34. Altmetric Badge
    Chapter 33 Mathematical Theory and Computational Practice
  35. Altmetric Badge
    Chapter 34 Infima of d . r . e . Degrees
  36. Altmetric Badge
    Chapter 35 A Divergence Formula for Randomness and Dimension
  37. Altmetric Badge
    Chapter 36 On Ladner’s Result for a Class of Real Machines with Restricted Use of Constants
  38. Altmetric Badge
    Chapter 37 0″-Categorical Completely Decomposable Torsion-Free Abelian Groups
  39. Altmetric Badge
    Chapter 38 Notes on the Jump of a Structure
  40. Altmetric Badge
    Chapter 39 A General Representation Theorem for Probability Functions Satisfying Spectrum Exchangeability
  41. Altmetric Badge
    Chapter 40 Stability under Strategy Switching
  42. Altmetric Badge
    Chapter 41 Computational Heuristics for Simplifying a Biological Model
  43. Altmetric Badge
    Chapter 42 Mathematical Theory and Computational Practice
  44. Altmetric Badge
    Chapter 43 Survey on Oblivious Routing Strategies
  45. Altmetric Badge
    Chapter 44 An Approach to the Engineering of Cellular Models Based on P Systems
  46. Altmetric Badge
    Chapter 45 Decidability of Sub-theories of Polynomials over a Finite Field
  47. Altmetric Badge
    Chapter 46 Chaitin Ω Numbers and Halting Problems
  48. Altmetric Badge
    Chapter 47 Bayesian Data Integration and Enrichment Analysis for Predicting Gene Function in Malaria
  49. Altmetric Badge
    Chapter 48 Dialectica Interpretation with Fine Computational Control
  50. Altmetric Badge
    Chapter 49 Algorithmic Minimal Sufficient Statistic Revisited
  51. Altmetric Badge
    Chapter 50 A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
  52. Altmetric Badge
    Chapter 51 On Generating Independent Random Strings
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (87th percentile)
  • High Attention Score compared to outputs of the same age and source (86th percentile)

Mentioned by

twitter
10 X users
wikipedia
3 Wikipedia pages

Citations

dimensions_citation
12 Dimensions

Readers on

mendeley
8 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.
Title
Graphs States and the necessity of Euler Decomposition
Published by
Lecture notes in computer science, January 2009
DOI 10.1007/978-3-642-03073-4
ISBNs
978-3-64-203072-7, 978-3-64-203073-4
Authors

Ross Duncan, Simon Perdrix

Editors

Ambos-Spies, Klaus, Löwe, Benedikt, Merkle, Wolfgang

X Demographics

X Demographics

The data shown below were collected from the profiles of 10 X users 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 8 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United Kingdom 1 13%
Canada 1 13%
Unknown 6 75%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 12 150%
Student > Bachelor 3 38%
Professor 3 38%
Student > Master 2 25%
Student > Postgraduate 2 25%
Other 3 38%
Readers by discipline Count As %
Physics and Astronomy 10 125%
Computer Science 8 100%
Mathematics 6 75%
Nursing and Health Professions 1 13%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 9. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 03 June 2022.
All research outputs
#4,204,129
of 25,718,113 outputs
Outputs from Lecture notes in computer science
#870
of 8,171 outputs
Outputs of similar age
#22,729
of 185,062 outputs
Outputs of similar age from Lecture notes in computer science
#24
of 176 outputs
Altmetric has tracked 25,718,113 research outputs across all sources so far. Compared to these this one has done well and is in the 83rd percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,171 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.2. This one has done well, scoring higher than 89% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 185,062 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 87% of its contemporaries.
We're also able to compare this research output to 176 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 86% of its contemporaries.