Dr George Mertzios george.mertzios@durham.ac.uk
Associate Professor
In this work a matrix representation that characterizes the interval and proper interval graphs is presented, which is useful for the efficient formulation and solution of optimization problems, such as the k-cluster problem. For the construction of this matrix representation every such graph is associated with a node versus node zero–one matrix. In contrast to representations used in most of the previous work, the proposed matrix characterization does not make use of the maximal cliques in the graph investigated.
Mertzios, G. (2008). A matrix characterization of interval and proper interval graphs. Applied Mathematics Letters, 21(4), 332-337. https://doi.org/10.1016/j.aml.2007.04.001
Journal Article Type | Article |
---|---|
Publication Date | Apr 1, 2008 |
Deposit Date | Dec 8, 2011 |
Journal | Applied Mathematics Letters |
Print ISSN | 0893-9659 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 21 |
Issue | 4 |
Pages | 332-337 |
DOI | https://doi.org/10.1016/j.aml.2007.04.001 |
Keywords | Interval graph, Proper interval graph, Matrix representation, Matrix characterization. |
Graphs with minimum fractional domatic number
(2023)
Journal Article
Sliding into the Future: Investigating Sliding Windows in Temporal Graphs
(2023)
Conference Proceeding
The complexity of computing optimum labelings for temporal connectivity
(2022)
Conference Proceeding
The complexity of temporal vertex cover in small-degree graphs
(2022)
Conference Proceeding
Interference-free walks in time: temporally disjoint paths
(2021)
Conference Proceeding
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
Apache License Version 2.0 (http://www.apache.org/licenses/)
Apache License Version 2.0 (http://www.apache.org/licenses/)
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search