Minimal proper interval completions (Q963366)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Minimal proper interval completions	scientific article

Statements

scholarly article

0 references

Minimal proper interval completions (English)

0 references

0 references

0 references

0 references

Information Processing Letters

0 references

publication date

19 April 2010

0 references

zbMATH Keywords

graph algorithms

0 references

proper interval graphs

0 references

minimal proper interval completions

0 references

bandwidth

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ipl.2007.11.013

0 references

Separability generalizes Dirac's theorem

0 references

Fixed-Parameter Tractability and Completeness I: Basic Results

0 references

Betweenness, orders and interval graphs

0 references

Algorithmic graph theory and perfect graphs

0 references

PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT

0 references

Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing

0 references

Minimal Split Completions of Graphs

0 references

Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions

0 references

Algorithms – ESA 2005

0 references

Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)

0 references

0 references

Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques

0 references

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

0 references

Minimal fill in O(\(n^{2.69}\)) time

0 references

Algorithmic Aspects of Vertex Elimination on Graphs

0 references

The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete

0 references

A linear time recognition algorithm for proper interval graphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ipl.2007.11.013

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

DBLP publication ID

journals/ipl/RapaportST08

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:963366

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