Efficient labelling algorithms for the maximum noncrossing matching problem (Q1315996)
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: Efficient labelling algorithms for the maximum noncrossing matching problem |
scientific article; zbMATH DE number 516871
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient labelling algorithms for the maximum noncrossing matching problem |
scientific article; zbMATH DE number 516871 |
Statements
Efficient labelling algorithms for the maximum noncrossing matching problem (English)
0 references
17 March 1994
0 references
VLSI layout
0 references
permutation
0 references
longest increasing subsequence
0 references
bipartite graph
0 references
noncrossing matching
0 references
