An algorithm for calculating top-dimensional bounding chains

Article Properties
  • Language
    English
  • DOI (url)
    10.7717/peerj-cs.153
  • Publication Date
    2018/05/28
  • Journal
    PeerJ Computer Science
  • Indian UGC (journal)
  • Refrences
    19
  • Citations
    2
  • J. Frederico Carvalho CAS/RPL, KTH, Royal Institute of Technology, Stockholm, Sweden
  • Mikael Vejdemo-Johansson Mathematics Department, City University of New York, College of Staten Island, New York, NY, United States of America
  • Danica Kragic CAS/RPL, KTH, Royal Institute of Technology, Stockholm, Sweden
  • Florian T. Pokorny CAS/RPL, KTH, Royal Institute of Technology, Stockholm, Sweden
Abstract
Cite
Carvalho, J. Frederico, et al. “An Algorithm for Calculating Top-Dimensional Bounding Chains”. PeerJ Computer Science, vol. 4, 2018, p. e153, https://doi.org/10.7717/peerj-cs.153.
Carvalho, J. F., Vejdemo-Johansson, M., Kragic, D., & Pokorny, F. T. (2018). An algorithm for calculating top-dimensional bounding chains. PeerJ Computer Science, 4, e153. https://doi.org/10.7717/peerj-cs.153
Carvalho, J. Frederico, Mikael Vejdemo-Johansson, Danica Kragic, and Florian T. Pokorny. “An Algorithm for Calculating Top-Dimensional Bounding Chains”. PeerJ Computer Science 4 (2018): e153. https://doi.org/10.7717/peerj-cs.153.
Carvalho JF, Vejdemo-Johansson M, Kragic D, Pokorny FT. An algorithm for calculating top-dimensional bounding chains. PeerJ Computer Science. 2018;4:e153.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Science
Science (General)
Cybernetics
Information theory
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
Title Journal Journal Categories Citations Publication Date
Efficient construction of 2-chains with a prescribed boundary 2017
Topological trajectory classification with filtrations of simplicial complexes and persistent homology

 The International Journal of Robotics Research
  • Technology: Mechanical engineering and machinery
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics
  • Technology: Mechanical engineering and machinery
  • Technology: Engineering (General). Civil engineering (General)
 20 2016
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
 27 2014
Improved bound for complexity of matrix multiplication 2013
Hardness Results for Homology Localization Discrete & Computational Geometry
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
 19 2011
Citations
Title Journal Journal Categories Citations Publication Date
The parameterized complexity of finding minimum bounded chains Computational Geometry
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
 2024
Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations Discrete & Computational Geometry
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
 2022
Citations Analysis
Category Category Repetition
Science: Mathematics2
Technology: Engineering (General). Civil engineering (General)2
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods1
Science: Mathematics: Instruments and machines: Electronic computers. Computer science1
The category Science: Mathematics 2 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations and was published in 2022. The most recent citation comes from a 2024 study titled The parameterized complexity of finding minimum bounded chains. This article reached its peak citation in 2024, with 1 citations. It has been cited in 2 different journals. Among related journals, the Computational Geometry cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year