Common Structured Patterns in Linear Graphs: Approximations and Combinatorics
Overview & Synopsis
A linear graph is a graph whose vertices are linearly ordered. This linear ordering allows pairs of disjoint edges to be either preceding (
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Common Structured Patterns in Linear Graphs: Approximations and Combinatorics |
|---|---|
| Author / Organization | Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2007 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-206596 |
| Original Source Link | Visit Source Page on hal.science » |