We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, finds an induced matching of size at least m/9. This is best possible
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, fin...
DOI
Add to ORKG