Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 63 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 11 tok/s Pro
GPT-5 High 10 tok/s Pro
GPT-4o 83 tok/s Pro
Kimi K2 139 tok/s Pro
GPT OSS 120B 438 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Minimum Monotone Tree Decomposition of Density Functions Defined on Graphs (2309.16045v1)

Published 27 Sep 2023 in cs.DS, cs.CC, and cs.CG

Abstract: Monotone trees - trees with a function defined on their vertices that decreases the further away from a root node one travels, are a natural model for a process that weakens the further one gets from its source. Given an aggregation of monotone trees, one may wish to reconstruct the individual monotone components. A natural representation of such an aggregation would be a graph. While many methods have been developed for extracting hidden graph structure from datasets, which makes obtaining such an aggregation possible, decomposing such graphs into the original monotone trees is algorithmically challenging. Recently, a polynomial time algorithm has been developed to extract a minimum cardinality collection of monotone trees (M-Tree Set) from a given density tree - but no such algorithm exists for density graphs that may contain cycles. In this work, we prove that extracting such minimum M-Tree Sets of density graphs is NP-Complete. We additionally prove three additional variations of the problem - such as the minimum M-Tree Set such that the intersection between any two monotone trees is either empty or contractible (SM-Tree Set) - are also NP-Complete. We conclude by providing some approximation algorithms, highlighted by a 3-approximation algorithm for computing the minimum SM-Tree Set for density cactus graphs.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (22)
  1. Metric graph reconstruction from noisy data. In Proc. 27th Sympos. Comput. Geom., pages 37–46, 2011.
  2. Semantic segmentation of microscopic neuroanatomical data by combining topological priors with encoder-decoder deep networks. Nature Machine Intelligence, 2:585–594, 2020.
  3. Minimal unimodal decompositions on trees. Journal of Applied and Computational Topology, 4:199–209, 2020.
  4. Gromov—hausdorff approximation of filamentary structures using reeb-type graphs. Discrete Comput. Geom., 53(3):621–649, April 2015.
  5. Smarttracing: self-learning-based neuron reconstruction. Brain Informatics, 2(3):135–144, 2015.
  6. Graph reconstruction by discrete morse theory. In Proc. Internat. Sympos. Comput. Geom., pages 31:1–31:15, 2018.
  7. Computers and intractability, volume 174. freeman San Francisco, 1979.
  8. Data skeletonization via reeb graphs. In J. Shawe-Taylor, R. S. Zemel, P. L. Bartlett, F. Pereira, and K. Q. Weinberger, editors, Advances in Neural Information Processing Systems 24, pages 837–845. Curran Associates, Inc., 2011.
  9. Dense reconstruction of brain-wide neuronal population close to the ground truth. bioRxiv, 2018.
  10. On the number of husimi trees: I. Proceedings of the National Academy of Sciences, 39(4):315–322, 1953.
  11. Linear-time computability of combinatorial problems on generalized-series-parallel graphs. In David S. Johnson, Takao Nishizeki, Akihiro Nozaki, and Herbert S. Wilf, editors, Discrete Algorithms and Complexity, pages 437–457. Academic Press, 1987.
  12. T. J. Hastie. Principal curves and surfaces. PhD thesis, Stanford University, 1984.
  13. B. Kégl and A. Krzyżak. Piecewise linear skeletonization using principal curves. IEEE Trans. Pattern Anal. Machine Intell., 24:59–74, January 2002.
  14. Hardness of set cover with intersection 1. In International Colloquium on Automata, Languages, and Programming, pages 624–635. Springer, 2000.
  15. Statistical analysis of metric graph reconstruction. J. Mach. Learn. Res., 15(1):3425–3446, January 2014.
  16. L. Magee and Y. Wang. Graph skeletonization of high-dimensional point cloud data via topological method. Journal of Computational Geometry, 13:429–470, 2022.
  17. On the complexity of locating linear facilities in the plane. Operations Research Letters, 1(5):194–197, 1982.
  18. U. Ozertem and D. Erdogmus. Locally defined principal curves and surfaces. Journal of Machine Learning Research, 12:1249–1286, 2011.
  19. Neurogps-tree: automatic reconstruction of large-scale neuronal populations with dense neurites. Nature Methods, 13(1):51–54, 2016.
  20. Thierry Sousbie. The persistent cosmic web and its filamentary structure – i. theory and implementation. Monthly Notices of the Royal Astronomical Society, 414:350 – 383, 06 2011.
  21. Detection and skeletonization of single neurons and tracer injections using topological methods. arXiv preprint arXiv:2004.02755, 2020.
  22. Efficient map reconstruction and augmentation via topological methods. In Proc. 23rd ACM SIGSPATIAL, page 25. ACM, 2015.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Authors (2)

  1. Lucas Magee
  2. Yusu Wang
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up