Bandwidth of convex bipartite graphs and related graphs (Q436544): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an 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.ipl.2012.02.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001287420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bandwidth of Caterpillars with Hairs of Length 1 and 2 / 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: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on a problem of Harary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results for approximating the bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth of bipartite permutation graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Bandwidth of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth of chain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Bandwidth for Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the bandwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On orthogonal ray graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth of Bipartite Permutation Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:36, 5 July 2024

scientific article
Language Label Description Also known as
English
Bandwidth of convex bipartite graphs and related graphs
scientific article

    Statements

    Bandwidth of convex bipartite graphs and related graphs (English)
    0 references
    0 references
    0 references
    25 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    bandwidth problem
    0 references
    (bi)convex bipartite graphs
    0 references
    2-directional orthogonal ray graphs
    0 references
    0 references