On interval graphs and matrice profiles
RAIRO-Oper. Res., 20 3 (1986) 245-256
Published online: 2017-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On Tradeoffs Between Width- and Fill-like Graph Parameters
Dariusz Dereniowski and Adam StańskiTheory of Computing Systems 63 (3) 450 (2019)
https://doi.org/10.1007/s00224-018-9882-1
Parameterizing above or below guaranteed values
Meena Mahajan, Venkatesh Raman and Somnath SikdarJournal of Computer and System Sciences 75 (2) 137 (2009)
https://doi.org/10.1016/j.jcss.2008.08.004
Fixed-Parameter Complexity of Minimum Profile Problems
Gregory Gutin, Stefan Szeider and Anders YeoAlgorithmica 52 (2) 133 (2008)
https://doi.org/10.1007/s00453-007-9144-0
Parameterized and Exact Computation
Gregory Gutin, Stefan Szeider and Anders YeoLecture Notes in Computer Science, Parameterized and Exact Computation 4169 60 (2006)
https://doi.org/10.1007/11847250_6
On the profile of the corona of two graphs
Yung-Ling Lai and Gerard J. ChangInformation Processing Letters 89 (6) 287 (2004)
https://doi.org/10.1016/j.ipl.2003.12.004
Interval degree and bandwidth of a graph
Fedor V Fomin and Petr A GolovachDiscrete Applied Mathematics 129 (2-3) 345 (2003)
https://doi.org/10.1016/S0166-218X(02)00574-7
Graph Searching and Interval Completion
Fedor V. Fomin and Petr A. GolovachSIAM Journal on Discrete Mathematics 13 (4) 454 (2000)
https://doi.org/10.1137/S0895480199350477
Graph-Theoretic Concepts in Computer Science
Fedor V. Fomin and Petr A. GolovachLecture Notes in Computer Science, Graph-Theoretic Concepts in Computer Science 1517 359 (1998)
https://doi.org/10.1007/10692760_29
A comparison of three algorithms for reducing the profile of a sparse matrix
Alain Billionnet and Jean-François BrêteauRAIRO - Operations Research 23 (3) 289 (1989)
https://doi.org/10.1051/ro/1989230302891