Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search (Q3651542): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:19, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search |
scientific article |
Statements
Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search (English)
0 references
11 December 2009
0 references
space representations
0 references
interval graphs
0 references
permutation graphs
0 references
