Search Results - "Fully-dynamic algorithms"

  • Showing 1 - 9 results of 9
Refine Results
  1. 1
    Cover Image

    Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs by Beisegel, Jesse, Köhler, Ekkehard, Scheffler, Robert, Strehler, Martin

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.08.2023
    Published in Algorithmica (01.08.2023)
    “…Solving problems on graphs dynamically calls for algorithms to function under repeated modifications to the graph and to be more efficient than solving the…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

    Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs by Gioan, Emeric, Paul, Christophe

    ISSN: 0166-218X, 1872-6771
    Published: Elsevier B.V 01.04.2012
    Published in Discrete Applied Mathematics (01.04.2012)
    “…In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs,…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  3. 3
    Cover Image

    A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs by Hell, Pavol, Shamir, Ron, Sharan, Roded

    ISSN: 0097-5397, 1095-7111
    Published: Philadelphia, PA Society for Industrial and Applied Mathematics 2001
    Published in SIAM journal on computing (2001)
    Get full text
    Journal Article
    Save to List
    Saved in:
  4. 4
    Cover Image

    Dynamic Algorithms for Approximate Steiner Trees by Raikwar, Hemraj, Sadharakiya, Harshil, Karmakar, Sushanta

    ISSN: 1532-0626, 1532-0634
    Published: Hoboken, USA John Wiley & Sons, Inc 10.04.2025
    Published in Concurrency and computation (10.04.2025)
    “…ABSTRACT This study investigates the dynamic Steiner tree problem. The objective of the Steiner tree problem is to compute a minimum‐weight tree connecting a…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  5. 5
    Cover Image

    Conjunctive Queries with Free Access Patterns under Updates by Kara, Ahmet, Nikolic, Milos, Olteanu, Dan, Zhang, Haozhe

    ISSN: 1860-5974, 1860-5974
    Published: Logical Methods in Computer Science e.V 01.01.2025
    Published in Logical methods in computer science (01.01.2025)
    “…We study the problem of answering conjunctive queries with free access patterns (CQAPs) under updates. A free access pattern is a partition of the free…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  6. 6
    Cover Image

    A fully dynamic algorithm for the recognition of P4-sparse graphs by Nikolopoulos, Stavros D., Palios, Leonidas, Papadopoulos, Charis

    ISSN: 0304-3975, 1879-2294
    Published: Elsevier B.V 29.06.2012
    Published in Theoretical computer science (29.06.2012)
    “…In this paper, we solve the dynamic recognition problem for the class of P4-sparse graphs: the objective is to handle edge/vertex additions and deletions, to…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  7. 7
    Cover Image

    Fully Dynamic Evaluation of Sequence Pair by Kozik, A.

    ISSN: 0278-0070, 1937-4151
    Published: IEEE 01.06.2013
    “…In the electronic design automation field, as well as in other areas, problem instances and solutions are often subject to discrete changes. The foundational…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  8. 8
    Cover Image

    Fully Dynamic Algorithm for the Steiner Tree Problem in Planar Graphs by Raikwar, Hemraj, Karmakar, Sushanta

    ISSN: 2832-1324
    Published: IEEE 01.11.2022
    “…In this paper, we propose a fully dynamic algorithm for the Steiner tree problem in a planar graph. We consider an undirected weighted planar graph G=(V, E)…”
    Get full text
    Conference Proceeding
    Save to List
    Saved in:
  9. 9
    Cover Image

    A fully dynamic algorithm for modular decomposition and recognition of cographs by Shamir, Ron, Sharan, Roded

    ISSN: 0166-218X, 1872-6771
    Published: Lausanne Elsevier B.V 15.02.2004
    Published in Discrete Applied Mathematics (15.02.2004)
    “…The problem of dynamically recognizing a graph property calls for efficiently deciding if an input graph satisfies the property under repeated modifications to…”
    Get full text
    Journal Article Conference Proceeding
    Save to List
    Saved in:

Search Tools: