The following pages link to The edge inducibility of graphs (Q3910550):
Displaying 20 items.
- An efficient parallel algorithm for scheduling interval ordered tasks (Q652455) (← links)
- A new approach for the domination problem on permutation graphs (Q750166) (← links)
- A Helly theorem for convexity in graphs (Q799698) (← links)
- Object-oriented interaction in resource constrained scheduling (Q918388) (← links)
- New sequential and parallel algorithms for interval graph recognition (Q922725) (← links)
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- A setup heuristic for interval orders (Q1064975) (← links)
- Solving the single step graph searching problem by solving the maximum two-independent set problem (Q1183488) (← links)
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs (Q1195488) (← links)
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs (Q1309452) (← links)
- The domatic number problem on some perfect graph families (Q1313715) (← links)
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs (Q1382285) (← links)
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (Q1575664) (← links)
- The Hamiltonian circuit problem for circle graphs is NP-complete (Q1823687) (← links)
- Achromatic number is NP-complete for cographs and interval graphs (Q1825646) (← links)
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs (Q1897361) (← links)
- Extreme chordal doubly nonnegative matrices with given row sums (Q2365672) (← links)
- The edge inducibility of graphs (Q3910550) (← links)
- The inducibility of complete bipartite graphs (Q4309990) (← links)
