Rank reduction of oriented graphs by vertex and edge deletions (Q722520)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6911186
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rank reduction of oriented graphs by vertex and edge deletions |
scientific article; zbMATH DE number 6911186 |
Statements
Rank reduction of oriented graphs by vertex and edge deletions (English)
0 references
26 July 2018
0 references
oriented graph
0 references
rank of skew-adjacency matrix
0 references
vertex deletion
0 references
edge deletion
0 references
fixed parameter tractable
0 references
parameterized complexity
0 references
0 references
0.951200306415558
0 references
0.8959536552429199
0 references
0.8945426940917969
0 references
0.7337026596069336
0 references
0.7325621843338013
0 references
