Maximum \(k\)-covering of weighted transitive graphs with applications (Q1207331): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| 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
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
