Q5091230 (Q5091230): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 15:53, 30 December 2024

scientific article; zbMATH DE number 7561564

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7561564

Statements

scholarly article

0 references

Falko Hegerfeld

0 references

0 references

publication date

21 July 2022

0 references

full work available at URL

https://arxiv.org/abs/1904.11244

0 references

zbMATH Keywords

matchings

0 references

adaptive analysis

0 references

parameterized complexity

0 references

MaRDI profile type

0 references

Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs

0 references

Matching Triangles and Basing Hardness on an Extremely Popular Conjecture

0 references

LRM-trees: compressed indices, adaptive sorting, and compressed permutations

0 references

On compressing permutations and adaptive sorting

0 references

Matching algorithms are fast in sparse random graphs

0 references

Parameterized aspects of triangle enumeration

0 references

TWO THEOREMS IN GRAPH THEORY

0 references

0 references

0 references

Matching and multidimensional matching in chordal and strongly chordal graphs

0 references

Robust and Adaptive Search

0 references

0 references

Paths, Trees, and Flowers

0 references

When can graph hyperbolicity be computed in linear time?

0 references

Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth

0 references

BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION

0 references

An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs

0 references

Faster scaling algorithms for general graph matching problems

0 references

0 references

Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs

0 references

Maximum matching in a convex bipartite graph

0 references

Maximum skew-symmetric flows and matchings

0 references

A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing

0 references

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

0 references

Computing Graph Distances Parameterized by Treewidth and Diameter

0 references

On the Power of Tree-Depth for Fully Polynomial FPT Algorithms

0 references

Efficient and Adaptive Parameterized Algorithms on Modular Decompositions

0 references

Finding a maximum matching in a circular-arc graph

0 references

The Power of Linear-Time Data Reduction for Maximum Matching

0 references

A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs

0 references

Sparsity. Graphs, structures, and algorithms

0 references

0 references

A graph‐theoretic generalization of the clique concept

0 references

A linear time algorithm for maximum matchings in convex, bipartite graphs

0 references

Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion

0 references

An O(\(n\)) time algorithm for maximum matching on cographs

0 references

Maximum matching in regular and almost regular graphs

0 references

0 references

Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

10.4230/LIPICS.ICALP.2019.71

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5091230

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5091230&oldid=39529038"