Node-searching problem on block graphs (Q2462351): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2007.08.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079812956 / rank
 
Normal rank
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: Monotonicity in graph searching / 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: The Pathwidth and Treewidth of Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Localizing combinatorial properties for partitions on block 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: On the pathwidth of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Block-Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5555548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On metric properties of certain clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Certain Ptolemaic 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: 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: 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: Q4218431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching on some subclasses of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal path cover problem on block graphs / rank
 
Normal rank

Latest revision as of 13:43, 27 June 2024

scientific article
Language Label Description Also known as
English
Node-searching problem on block graphs
scientific article

    Statements

    Node-searching problem on block graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 November 2007
    0 references
    0 references
    avenue
    0 references
    block graphs
    0 references
    node-searching problem
    0 references
    path-width
    0 references
    vertex separation
    0 references
    0 references