enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Computational topology - Wikipedia

    en.wikipedia.org/wiki/Computational_topology

    In some applications, such as in TDA, it is useful to have representatives of (co)homology classes that are as "small" as possible. This is known as the problem of (co)homology localization. On triangulated manifolds, given a chain representing a homology class, it is in general NP-hard to approximate the minimum-support homologous chain [22].

  3. List of NP-complete problems - Wikipedia

    en.wikipedia.org/wiki/List_of_NP-complete_problems

    The problem for graphs is NP-complete if the edge lengths are assumed integers. The problem for points on the plane is NP-complete with the discretized Euclidean metric and rectilinear metric. The problem is known to be NP-hard with the (non-discretized) Euclidean metric. [3]: ND22, ND23

  4. Open and closed maps - Wikipedia

    en.wikipedia.org/wiki/Open_and_closed_maps

    In mathematics, more specifically in topology, an open map is a function between two topological spaces that maps open sets to open sets. [1] [2] [3] That is, a function : is open if for any open set in , the image is open in . Likewise, a closed map is a function that maps closed sets to closed sets.

  5. Digital topology - Wikipedia

    en.wikipedia.org/wiki/Digital_topology

    Digital topology was first studied in the late 1960s by the computer image analysis researcher Azriel Rosenfeld (1931–2004), whose publications on the subject played a major role in establishing and developing the field. The term "digital topology" was itself invented by Rosenfeld, who used it in a 1973 publication for the first time.

  6. Topological data analysis - Wikipedia

    en.wikipedia.org/wiki/Topological_data_analysis

    The Database of Original & Non-Theoretical Uses of Topology (DONUT) is a database of scholarly articles featuring practical applications of topological data analysis to various areas of science. DONUT was started in 2017 by Barbara Giunti, Janis Lazovskis, and Bastian Rieck, [ 154 ] and as of October 2023 currently contains 447 articles. [ 155 ]

  7. List of unsolved problems in computer science - Wikipedia

    en.wikipedia.org/wiki/List_of_unsolved_problems...

    Open problems around exact algorithms by Gerhard J. Woeginger, Discrete Applied Mathematics 156 (2008) 397–405. The RTA list of open problems – open problems in rewriting. The TLCA List of Open Problems – open problems in area typed lambda calculus

  8. Topological graph theory - Wikipedia

    en.wikipedia.org/wiki/Topological_graph_theory

    A basic embedding problem often presented as a mathematical puzzle is the three utilities problem. Other applications can be found in printing electronic circuits where the aim is to print (embed) a circuit (the graph) on a circuit board (the surface) without two connections crossing each other and resulting in a short circuit .

  9. Topology - Wikipedia

    en.wikipedia.org/wiki/Topology

    A three-dimensional model of a figure-eight knot.The figure-eight knot is a prime knot and has an Alexander–Briggs notation of 4 1.. Topology (from the Greek words τόπος, 'place, location', and λόγος, 'study') is the branch of mathematics concerned with the properties of a geometric object that are preserved under continuous deformations, such as stretching, twisting, crumpling ...