Maximum \(k\)-covering of weighted transitive graphs with applications (Q1207331)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximum k-covering of weighted transitive graphs with applications |
scientific article; zbMATH DE number 149509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum \(k\)-covering of weighted transitive graphs with applications |
scientific article; zbMATH DE number 149509 |
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
