No label defined (Q5126619)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7262444

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

Statements

scholarly article

0 references

publication date

20 October 2020

0 references

full work available at URL

https://arxiv.org/abs/1612.01966

0 references

zbMATH Keywords

networks/graphs

0 references

integer programming

0 references

cutting plane/facet

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

On the Desirability of Acyclic Database Schemes

0 references

A Benders Approach to the Minimum Chordal Completion Problem

0 references

A wide-range algorithm for minimal triangulation from an arbitrary ordering

0 references

Graph-Theoretic Concepts in Computer Science

0 references

Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems

0 references

Treewidth and Minimum Fill-in: Grouping the Minimal Separators

0 references

Chordal editing is fixed-parameter tractable

0 references

Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds

0 references

Chordal completions of planar graphs

0 references

Combinatorial Benders' Cuts for Mixed-Integer Linear Programming

0 references

Minimum fill-in of sparse graphs: kernelization and approximation

0 references

0 references

Incidence matrices and interval graphs

0 references

0 references

The Evolution of the Minimum Degree Ordering Algorithm

0 references

Positive definite completions of partial Hermitian matrices

0 references

Minimal triangulations of graphs: a survey

0 references

Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

0 references

Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion

0 references

Approximating the Bandwidth for Asteroidal Triple-Free Graphs

0 references

Minimum Fill-in on Circle and Circular-Arc Graphs

0 references

On a property of minimal triangulations

0 references

Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network

0 references

Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results

0 references

A Polynomial Approximation Algorithm for the Minimum Fill-In Problem

0 references

Detecting holes and antiholes in graphs

0 references

A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph

0 references

Minimal triangulation of a graph and optimal pivoting order in a sparse matrix

0 references

How to use the minimal separators of a graph for its chordal triangulation

0 references

Characterizations and algorithmic applications of chordal graph embeddings

0 references

The Use of Linear Graphs in Gauss Elimination

0 references

0 references

Algorithmic Aspects of Vertex Elimination on Directed Graphs

0 references

Algorithmic Aspects of Vertex Elimination on Graphs

0 references

Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs

0 references

Computing the Minimum Fill-In is NP-Complete

0 references

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

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5126619

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