A fuzzy model for NMT word alignment using quasi-perfect matching
From MaRDI portal
Publication:6184809
DOI10.1007/s40314-023-02498-1OpenAlexW4389142014MaRDI QIDQ6184809
No author found.
Publication date: 5 January 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-023-02498-1
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- Unnamed Item
- Unnamed Item
- Bipolar fuzzy graphs
- Algorithms for finding k-best perfect matchings
- Constrained weighted matchings and edge coverings in graphs
- Fuzzy graph theory
- Matching numbers in fuzzy graphs
- Bipartite double cover and perfect 2-matching covered graph with its algorithm
- Coverings, matchings and paired domination in fuzzy graphs using strong arcs
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Inverse Fuzzy Graphs with Applications
This page was built for publication: A fuzzy model for NMT word alignment using quasi-perfect matching
