scientific article; zbMATH DE number 7359421

DOI10.4230/LIPIcs.FSCD.2018.25zbMath1462.03030MaRDI QIDQ4993356

Lê Thành Dũng Nguyên

Publication date: 15 June 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

matching algorithmscorrectness criteria

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cites Work

• Visible acyclic differential nets. I: Semantics
• Correctness of linear logic proof structures is NL-complete
• A linear algorithm for MLL proof net correctness and sequentialization
• A linear-time algorithm for a special case of disjoint set union
• Matching is as easy as matrix inversion
• The structure of multiplicatives
• Handsome proof-nets: Perfect matchings and cographs
• Finding paths in graphs avoiding forbidden transitions
• Unique Maximum Matching Algorithms
• On the Dependencies of Logical Rules
• Maximum matchings in general graphs through randomization
• Constant Depth Reducibility
• On the Bipartite Unique Perfect Matching Problem
• The mix rule
• Fast verification of MLL proof nets via IMLL
• Paths, Trees, and Flowers
• Digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: