Pages that link to "Item:Q1671003"
From MaRDI portal
The following pages link to Efficient enumeration of subgraphs and induced subgraphs with bounded girth (Q1671003):
Displaying 6 items.
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs (Q1708606) (← links)
- An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs (Q2301754) (← links)
- Efficient enumeration of non-isomorphic interval graphs (Q4987268) (← links)
- Enumerating Minimal Transversals of Hypergraphs without Small Holes (Q5005157) (← links)
- Listing subgraphs by Cartesian decomposition (Q5005188) (← links)