Pages that link to "Item:Q3648499"
From MaRDI portal
The following pages link to A Simple Linear Time LexBFS Cograph Recognition Algorithm (Q3648499):
Displaying 10 items.
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- A general label search to investigate classical graph search algorithms (Q617648) (← links)
- A simple linear-time recognition algorithm for weakly quasi-threshold graphs (Q659727) (← links)
- Characterizations of cographs as intersection graphs of paths on a grid (Q741533) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
- Graphon convergence of random cographs (Q6074665) (← links)
- Random cographs: Brownian graphon limit and asymptotic degree distribution (Q6074680) (← links)
- Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints (Q6124916) (← links)
