Pattern matching with wildcards and length constraints using maximum network flow (Q891817)
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: Pattern matching with wildcards and length constraints using maximum network flow |
scientific article; zbMATH DE number 6510085
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pattern matching with wildcards and length constraints using maximum network flow |
scientific article; zbMATH DE number 6510085 |
Statements
Pattern matching with wildcards and length constraints using maximum network flow (English)
0 references
17 November 2015
0 references
pattern matching with wildcards
0 references
string algorithm
0 references
maximum flow
0 references
maximal vertex-disjoint paths
0 references
maximal edge-disjoint paths
0 references
0.8468199372291565
0 references
0.7712670564651489
0 references
0.7679970264434814
0 references
0.7590312957763672
0 references
0.7586705088615417
0 references
