Edge and node searching problems on trees (Q1575444): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Pathwidth of Permutation Graphs / 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: The Pathwidth and Treewidth of Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity in graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees / 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: Q3199182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the pathwidth of chordal graphs / 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: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrowness, pathwidth, and their application in natural language processing / 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: Topological Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimizing width in linear layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min Cut is NP-complete for edge weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4159394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge and node searching problems on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3475289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank
 
Normal rank

Revision as of 13:12, 30 May 2024

scientific article
Language Label Description Also known as
English
Edge and node searching problems on trees
scientific article

    Statements

    Edge and node searching problems on trees (English)
    0 references
    0 references
    21 August 2000
    0 references
    0 references
    algorithm
    0 references
    edge searching
    0 references
    node searching
    0 references
    pathwidth
    0 references
    tree
    0 references