Login / Signup

A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring.

Egon Balas
Published in: Discret. Appl. Math. (1986)
Keyphrases
  • edge information
  • edge detector
  • data structure
  • np hard
  • edge detection
  • strongly connected