Extending Partial Representations of Proper and Unit Interval Graphs
暂无分享,去创建一个
Yota Otachi | Toshiki Saitoh | Pavel Klavík | Jan Kratochvíl | Ignaz Rutter | Tomás Vyskocil | Maria Saumell
[1] Yota Otachi,et al. On the Classes of Interval Graphs of Limited Nesting and Count of Lengths , 2018, Algorithmica.
[2] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[3] Jeremy P. Spinrad,et al. Efficient graph representations , 2003, Fields Institute monographs.
[4] Anna Lubiw,et al. The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs , 2012, J. Graph Algorithms Appl..
[5] Xuding Zhu,et al. Completing orientations of partially oriented graphs , 2015, J. Graph Theory.
[6] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .
[7] Xiaotie Deng,et al. Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs , 1996, SIAM J. Comput..
[8] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..
[9] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[10] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[11] Yota Otachi,et al. Extending Partial Representations of Interval Graphs , 2011, Algorithmica.
[12] Pavel Klavík,et al. Minimal Obstructions for Partial Representations of Interval Graphs , 2014, ISAAC.
[13] Marc Pirlot,et al. Synthetic description of a semiorder , 1991, Discret. Appl. Math..
[14] Stephan Olariu,et al. The LBFS Structure and Recognition of Interval Graphs , 2009, SIAM J. Discret. Math..
[15] Yota Otachi,et al. Linear-time Algorithm for Partial Representation Extension of Interval Graphs , 2013, ArXiv.
[16] Stephan Olariu,et al. Simple Linear Time Recognition of Unit Interval Graphs , 1995, Inf. Process. Lett..
[17] M. Pirlot. Minimal representation of a semiorder , 1990 .
[18] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..
[19] Pavel Klavík,et al. Extending Partial Representations of Circle Graphs , 2013, Graph Drawing.
[20] David S. Johnson,et al. Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..
[21] Jan Kratochvíl,et al. Testing planarity of partially embedded graphs , 2010, SODA '10.
[22] Jayme Luiz Szwarcfiter,et al. On unit interval graphs with integer endpoints , 2015, Electron. Notes Discret. Math..
[23] Ronald L. Rivest,et al. Introduction to Algorithms, third edition , 2009 .
[24] Martin Fürer,et al. Faster integer multiplication , 2007, STOC '07.
[25] Ignaz Rutter,et al. Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems , 2013, SODA.
[26] Pavel Klav ´ ik. Extending Partial Representations of Interval Graphs , 2012 .
[27] Peter L. Hammer,et al. Difference graphs , 1990, Discret. Appl. Math..
[28] Anna Lubiw,et al. Simultaneous Interval Graphs , 2010, ISAAC.
[29] Samuel Fiorini,et al. The Representation Polyhedron of a Semiorder , 2013, Order.
[30] Yota Otachi,et al. Bounded Representations of Interval and Proper Interval Graphs , 2013, ISAAC.
[31] Yota Otachi,et al. Extending Partial Representations of Subclasses of Chordal Graphs , 2012, ISAAC.
[32] Francisco J. Soulignac. Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory , 2017, J. Graph Algorithms Appl..
[33] Maurizio Patrignani. On Extending a Partial Straight-line Drawing , 2006, Int. J. Found. Comput. Sci..
[34] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.
[35] Francisco J. Soulignac. Minimal and short representations of unit interval and unit circular-arc graphs , 2014, ArXiv.
[36] Yota Otachi,et al. Extending Partial Representations of Proper and Unit Interval Graphs , 2012, Algorithmica.
[37] Paul Dorbec,et al. Contact Representations of Planar Graphs: Extending a Partial Representation is Hard , 2014, WG.
[38] Pavel Klavík,et al. Extending Partial Representations of Function Graphs and Permutation Graphs , 2012, ESA.