Approximate search strategies for weighted trees (Q1929222): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033462251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of pathwidth of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-searching problem on block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected searching of weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Pathwidth to Connected Pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the vertex separation of unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation and search number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for minimum-weight vertex separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-approximation for the pathwidth of Halin graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on guaranteed graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the pathwidth of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recontamination does not help to search a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth is NP-Hard for Weighted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected graph searching in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth of Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sweeping graphs with large clique number / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:20, 6 July 2024

scientific article
Language Label Description Also known as
English
Approximate search strategies for weighted trees
scientific article

    Statements

    Approximate search strategies for weighted trees (English)
    0 references
    7 January 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    connected searching
    0 references
    edge searching
    0 references
    graph searching
    0 references
    node searching
    0 references
    pathwidth
    0 references
    0 references
    0 references
    0 references
    0 references