Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577): 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.1007/978-3-540-74839-7_29 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1541078787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of search games and rendezvous. / 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: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Linear Arrangement of Interval Graphs / 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: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some generalizations of the problem on the search number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / 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: Computing the Bandwidth of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the branchwidth of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766686 / 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: Q4159394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the interval completion of chordal graphs / 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: Mixed searching and proper-path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and obstructions for linear-width and related search parameters / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:59, 28 June 2024

scientific article
Language Label Description Also known as
English
Mixed Search Number and Linear-Width of Interval and Split Graphs
scientific article

    Statements

    Mixed Search Number and Linear-Width of Interval and Split Graphs (English)
    0 references
    0 references
    0 references
    0 references
    1 July 2008
    0 references

    Identifiers