scientific article; zbMATH DE number 1496857
From MaRDI portal
Publication:4500845
Recommendations
- A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
- A linear algorithm for computing of a minimum weight maximal induced matching in an edge-weighted tree
- An efficient algorithm for some tree matching problems
- Maximum induced matchings for chordal graphs in linear time
- Exact algorithms for maximum induced matching
- Linear-time algorithms for tree root problems
- Linear-Time Algorithms for Tree Root Problems
- Moderately exponential time algorithms for the maximum induced matching problem
- Exact and approximate algorithms for unordered tree matching
- Approximating Maximum Leaf Spanning Trees in Almost Linear Time
Cited in
(16)- Parameterized algorithms for inclusion of linear matchings
- An efficient algorithm for some tree matching problems
- A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs
- Generalized subgraph-restricted matchings in graphs
- Induced matchings in asteroidal triple-free graphs
- A linear algorithm for computing of a minimum weight maximal induced matching in an edge-weighted tree
- On distance-3 matchings and induced matchings
- An improved exact algorithm for maximum induced matching
- On distance-3 matchings and induced matchings
- Maximum induced matchings for chordal graphs in linear time
- Moderately exponential time algorithms for the maximum induced matching problem
- On the number of \(r\)-matchings in a tree
- scientific article; zbMATH DE number 1420901 (Why is no real title available?)
- scientific article; zbMATH DE number 434499 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500845)
