Добірка наукової літератури з теми "Unit multiple interval graphs"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Unit multiple interval graphs".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Unit multiple interval graphs"
Ardévol Martínez, Virginia, Romeo Rizzi, Florian Sikora, and Stéphane Vialette. "Recognizing unit multiple interval graphs is hard." Discrete Applied Mathematics 360 (January 2025): 258–74. http://dx.doi.org/10.1016/j.dam.2024.09.011.
Повний текст джерелаCardoza, Jacqueline E., Carina J. Gronlund, Justin Schott, Todd Ziegler, Brian Stone, and Marie S. O’Neill. "Heat-Related Illness Is Associated with Lack of Air Conditioning and Pre-Existing Health Problems in Detroit, Michigan, USA: A Community-Based Participatory Co-Analysis of Survey Data." International Journal of Environmental Research and Public Health 17, no. 16 (August 7, 2020): 5704. http://dx.doi.org/10.3390/ijerph17165704.
Повний текст джерелаRautenbach, Dieter, and Jayme L. Szwarcfiter. "Unit Interval Graphs." Electronic Notes in Discrete Mathematics 38 (December 2011): 737–42. http://dx.doi.org/10.1016/j.endm.2011.10.023.
Повний текст джерелаDourado, Mitre C., Van Bang Le, Fábio Protti, Dieter Rautenbach, and Jayme L. Szwarcfiter. "Mixed unit interval graphs." Discrete Mathematics 312, no. 22 (November 2012): 3357–63. http://dx.doi.org/10.1016/j.disc.2012.07.037.
Повний текст джерелаGrippo, Luciano N. "Characterizing interval graphs which are probe unit interval graphs." Discrete Applied Mathematics 262 (June 2019): 83–95. http://dx.doi.org/10.1016/j.dam.2019.02.022.
Повний текст джерелаKulik, Anatoliy, Sergey Pasichnik, and Dmytro Sokol. "MODELING OF PHYSICAL PROCESSES OF ENERGY CONVERSION IN SMALL-SIZED VORTEX ENERGY SEPARATORS." Aerospace technic and technology, no. 1 (February 26, 2021): 20–30. http://dx.doi.org/10.32620/aktt.2021.1.03.
Повний текст джерелаLe, Van Bang, and Dieter Rautenbach. "Integral mixed unit interval graphs." Discrete Applied Mathematics 161, no. 7-8 (May 2013): 1028–36. http://dx.doi.org/10.1016/j.dam.2012.09.013.
Повний текст джерелаJinjiang, Yuan, and Zhou Sanming. "Optimal labelling of unit interval graphs." Applied Mathematics 10, no. 3 (September 1995): 337–44. http://dx.doi.org/10.1007/bf02662875.
Повний текст джерелаMarx, Dániel. "Precoloring extension on unit interval graphs." Discrete Applied Mathematics 154, no. 6 (April 2006): 995–1002. http://dx.doi.org/10.1016/j.dam.2005.10.008.
Повний текст джерелаLin, Min Chih, Francisco J. Soulignac, and Jayme L. Szwarcfiter. "Short Models for Unit Interval Graphs." Electronic Notes in Discrete Mathematics 35 (December 2009): 247–55. http://dx.doi.org/10.1016/j.endm.2009.11.041.
Повний текст джерелаДисертації з теми "Unit multiple interval graphs"
Ardevol, martinez Virginia. "Structural and algorithmic aspects of (multiple) interval graphs." Electronic Thesis or Diss., Université Paris sciences et lettres, 2024. http://www.theses.fr/2024UPSLD028.
Повний текст джерелаMultiple interval graphs are a well-known generalization of interval graphs, where each vertex of a graph is represented by a d-interval (the union of d intervals) for some natural number d > 1, and there exists an edge between two vertices if and only if their corresponding d-intervals intersect. In particular, a d-interval graph is unit if all the intervals on the representation have unit length. In this thesis, we study unit d-interval graphs from a structural and an algorithmic perspective. In the first part, we tryto generalize Roberts characterization of unit interval graphs, which states that a graph is unit interval if and only if it is interval and it does not contain the complete bipartite graph K1,3 as an induced subgraph. Then, we move on to studythe complexity of recognizing unit multiple interval graphs. We prove that given a graph G it is NP-hard to determine whether G is a unit d-interval graph, and then extend this hardness result to other subclasses of unit d-interval graphs. Inthe last part of this manuscript, we focus on the PIG-completion problem, where given an interval graph G, we are asked to find the minimum number of edges that we need to add to G so that it becomes a proper interval graph. We obtain apolynomial algorithm when G contains a vertex that is adjacent to every other vertex of the graph, and an XP algorithm parameterized by a structural property of the graph
Vestin, Albin, and Gustav Strandberg. "Evaluation of Target Tracking Using Multiple Sensors and Non-Causal Algorithms." Thesis, Linköpings universitet, Reglerteknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-160020.
Повний текст джерелаTu, Yuan-Lung, and 塗元龍. "A Study on Unit Interval Graphs." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/76002582966141739137.
Повний текст джерела輔仁大學
數學系碩士班
101
The purpose of this thesis is to study some characterizations of unit interval graphs and an algorithm that are used to recognize whethere a given graph is a unit interval graph or not. The former is based on the book ”Introduction to graph theory” written by D. B. West; and the latter is based on the paper ”A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs” by D. G. Corneil.
Williams, Aaron Michael. "Shift gray codes." Thesis, 2009. http://hdl.handle.net/1828/1966.
Повний текст джерелаКниги з теми "Unit multiple interval graphs"
Wijdicks, Eelco F. M., and Sarah L. Clark. Neurocritical Care Pharmacotherapy. Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780190684747.001.0001.
Повний текст джерелаЧастини книг з теми "Unit multiple interval graphs"
Le, Van Bang, and Dieter Rautenbach. "Integral Mixed Unit Interval Graphs." In Lecture Notes in Computer Science, 495–506. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32241-9_42.
Повний текст джерелаJoos, Felix. "A Characterization of Mixed Unit Interval Graphs." In Graph-Theoretic Concepts in Computer Science, 324–35. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12340-0_27.
Повний текст джерелаJiang, Minghui, and Yong Zhang. "Parameterized Complexity in Multiple-Interval Graphs: Domination." In Parameterized and Exact Computation, 27–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-28050-4_3.
Повний текст джерелаTalon, Alexandre, and Jan Kratochvil. "Completion of the Mixed Unit Interval Graphs Hierarchy." In Lecture Notes in Computer Science, 284–96. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17142-5_25.
Повний текст джерелаAlam, M. J., S. G. Kobourov, S. Pupyrev, and J. Toeniskoetter. "Weak Unit Disk and Interval Representation of Graphs." In Graph-Theoretic Concepts in Computer Science, 237–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53174-7_17.
Повний текст джерелаCao, Yixin. "Recognizing (Unit) Interval Graphs by Zigzag Graph Searches." In Symposium on Simplicity in Algorithms (SOSA), 92–106. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2021. http://dx.doi.org/10.1137/1.9781611976496.11.
Повний текст джерелаKlavík, Pavel, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, and Tomáš Vyskočil. "Extending Partial Representations of Proper and Unit Interval Graphs." In Algorithm Theory – SWAT 2014, 253–64. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08404-6_22.
Повний текст джерелаJiang, Minghui, and Yong Zhang. "Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy." In Lecture Notes in Computer Science, 62–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22685-4_6.
Повний текст джерелаFrancis, Mathew C., Daniel Gonçalves, and Pascal Ochem. "The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)." In Graph-Theoretic Concepts in Computer Science, 57–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34611-8_9.
Повний текст джерелаZhou, Yunhong. "Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems." In Algorithms and Computation, 494–506. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11940128_50.
Повний текст джерелаТези доповідей конференцій з теми "Unit multiple interval graphs"
Sampaio Jr., Moysés S., Fabiano S. Oliveira, and Jayme L. Szwarcfiter. "Sobre Finura Própria de Grafos." In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3165.
Повний текст джерелаEisenstat, David, and Philip N. Klein. "Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs." In the 45th annual ACM symposium. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2488608.2488702.
Повний текст джерелаSun, M., Z. X. Yang, N. Guo, and R. J. Jardine. "Three-Dimensional DEM Simulation of Plugging Behaviour of Small-Diameter Open-Ended Model Piles Penetrating Into Sand." In Innovative Geotechnologies for Energy Transition. Society for Underwater Technology, 2023. http://dx.doi.org/10.3723/joia5398.
Повний текст джерелаCampanari, Stefano, Luca Boncompagni, and Ennio Macchi. "Microturbines and Trigeneration: Optimization Strategies and Multiple Engine Configuration Effects." In ASME Turbo Expo 2002: Power for Land, Sea, and Air. ASMEDC, 2002. http://dx.doi.org/10.1115/gt2002-30417.
Повний текст джерелаPatrão, Caroline, Luis Kowada, Diane Castonguay, André Ribeiro, and Celina Figueiredo. "Some exact values for the diameter in Cayley graph Hl,p." In IV Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/etc.2019.6395.
Повний текст джерелаMellal, I., V. Rasouli, A. Dehdouh, A. Letrache, C. Abdelhamid, M. L. Malki, and O. Bakelli. "Formation Evaluation Challenges of Tight and Shale Reservoirs. A Case Study of the Bakken Petroleum System." In 57th U.S. Rock Mechanics/Geomechanics Symposium. ARMA, 2023. http://dx.doi.org/10.56952/arma-2023-0894.
Повний текст джерелаZeng, Qingna, Donghui Wang, Fenggang Zang, Yixiong Zhang, Bihao Wang, and Zhihao Yuan. "Disorders in Fluid Filled Pipeline Structure With Elastic Helmholtz Resonators." In 2022 29th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2022. http://dx.doi.org/10.1115/icone29-93421.
Повний текст джерелаBartkowiak, Tomasz. "Characterization of 3D Surface Texture Directionality Using Multi-Scale Curvature Tensor Analysis." In ASME 2017 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/imece2017-71609.
Повний текст джерелаEnikov, Eniko T., Péter P. Polyvás, Gholam Peyman, and Sean Mccafferty. "Tactile Eye Pressure Measurement Through the Eyelid." In ASME 2015 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/imece2015-50875.
Повний текст джерелаMatzenauer, Mônica, Renata Reiser, and Helida Santos. "An approach for consensual analysis on Typical Hesitant Fuzzy Sets via extended aggregations and fuzzy implications based on admissible orders." In Workshop-Escola de Informática Teórica. Sociedade Brasileira de Computação, 2021. http://dx.doi.org/10.5753/weit.2021.18937.
Повний текст джерела