Maximum \(k\)-covering of weighted transitive graphs with applications (Q1207331): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Majid Sarrafzadeh / rank
Normal rank
 
Property / author
 
Property / author: Majid Sarrafzadeh / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for maxdominance, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel routing of multiterminal nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximumk-colorings andk-coverings of transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Solution for the Channel-Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for interval graphs and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular permutation graph family with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Maximum Two-Chain Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel routing in knock-knee mode: Simplified algorithms and proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Three-Layer Channel Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Comparability and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677669 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01185340 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1903290558 / rank
 
Normal rank

Latest revision as of 08:40, 30 July 2024

scientific article
Language Label Description Also known as
English
Maximum \(k\)-covering of weighted transitive graphs with applications
scientific article

    Statements

    Maximum \(k\)-covering of weighted transitive graphs with applications (English)
    0 references
    0 references
    0 references
    0 references
    1 April 1993
    0 references
    network flow
    0 references
    integer sequences
    0 references
    transitive graph
    0 references
    VLSI layout
    0 references
    \(k\)-layer topological via minimization
    0 references
    maximum multidimensional \(k\)-chain
    0 references
    maximum \(k\)-independent set of interval graphs
    0 references
    maximum increasing \(k\)- subsequence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references