| Display title | Interval (graph theory) |
| Default sort key | Interval (graph theory) |
| Page length (in bytes) | 2,737 |
| Namespace ID | 0 |
| Page ID | 249847 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Wikisleeper |
| Date of page creation | 22:05, 9 July 2021 |
| Latest editor | imported>Wikisleeper |
| Date of latest edit | 22:05, 9 July 2021 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In graph theory, an interval I(h) in a directed graph is a maximal, single entry subgraph in which h is the only entry to I(h) and all closed paths in I(h) contain h. Intervals were described in 1970 by F. E. Allen and J. Cocke. Interval graphs are integral to some algorithms used in compilers, specifically... |
