Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set

@inproceedings{Jeong2015MaximumMW,
  title={Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set},
  author={Jisu Jeong and Sigve Hortemo S{\ae}ther and Jan Arne Telle},
  booktitle={IPEC},
  year={2015}
}
  • Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle
  • Published in IPEC 2015
  • Mathematics, Computer Science
  • We give alternative definitions for maximum matching width, e.g., a graph G has mmw(G) log_3(8) * k ~ 1.893 k. Note that mmw(G) 1.549 * mmw(G). 
    1
    Twitter Mention

    Figures and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 16 REFERENCES