Maximum \(k\)-covering of weighted transitive graphs with applications (Q1207331): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:23, 31 January 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
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
