Добірка наукової літератури з теми "Cover graph"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Cover graph".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Cover graph"
Arumugam, S., Indra Rajasingh, and P. Roushini Leely Pushpam. "Characterization of a class of graphs with unique minimum graphoidal cover." Tamkang Journal of Mathematics 34, no. 4 (2003): 317–26. http://dx.doi.org/10.5556/j.tkjm.34.2003.234.
Повний текст джерелаWang, Shiping, Qingxin Zhu, William Zhu, and Fan Min. "Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets." Journal of Applied Mathematics 2013 (2013): 1–7. http://dx.doi.org/10.1155/2013/519173.
Повний текст джерелаTsiovkina, Ludmila Yu. "ON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS." Ural Mathematical Journal 7, no. 2 (2021): 136. http://dx.doi.org/10.15826/umj.2021.2.010.
Повний текст джерелаBilar, Vergel, Maria Andrea Bonsocan, Javier Hassan, and Susan Dagondon. "Vertex Cover Hop Dominating Sets in Graphs." European Journal of Pure and Applied Mathematics 17, no. 1 (2024): 93–104. http://dx.doi.org/10.29020/nybg.ejpam.v17i1.4978.
Повний текст джерелаScaria, Deena C., John Joy Mulloor, Liju Alex, and Gopal Indulal. "A note on some graph parameters and graph operations." Open Journal of Discrete Applied Mathematics 8, no. 2 (2025): 32–44. https://doi.org/10.30538/psrp-odam2025.0114.
Повний текст джерелаPriscilla, Paul, and Syed Ali Fathima S. "A Study on Edge Pebbling Number, Covering Cover Edge Pebbling Number of Friendship Graphs, Odd Path and Even Path." Indian Journal of Science and Technology 16, no. 32 (2023): 2480–84. https://doi.org/10.17485/IJST/v16i32.674.
Повний текст джерелаZHOU, JIN-XIN, and YAN-QUAN FENG. "TETRAVALENT s-TRANSITIVE GRAPHS OF ORDER TWICE A PRIME POWER." Journal of the Australian Mathematical Society 88, no. 2 (2010): 277–88. http://dx.doi.org/10.1017/s1446788710000066.
Повний текст джерелаAlikhani, Saeid. "Graphs Whose Certain Polynomials Have Few Distinct Roots." ISRN Discrete Mathematics 2013 (September 12, 2013): 1–8. http://dx.doi.org/10.1155/2013/195818.
Повний текст джерелаLiu, Zhi-Qiang, Ping Tang, Weixiong Zhang, and Zheng Zhang. "CNN-Enhanced Heterogeneous Graph Convolutional Network: Inferring Land Use from Land Cover with a Case Study of Park Segmentation." Remote Sensing 14, no. 19 (2022): 5027. http://dx.doi.org/10.3390/rs14195027.
Повний текст джерелаDomagalski, Rachel, and Sivaram Narayan. "Tree Cover Number and Maximum Semidefinite Nullity of Some Graph Classes." Electronic Journal of Linear Algebra 36, no. 36 (2020): 678–93. http://dx.doi.org/10.13001/ela.2020.5319.
Повний текст джерелаДисертації з теми "Cover graph"
Meek, Darrin Leigh. "On graph approximation heuristics : an application to vertex cover on planar graphs." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/24088.
Повний текст джерелаAbdullah, Mohammed. "The cover time of random walks on graph." Thesis, King's College London (University of London), 2012. https://kclpure.kcl.ac.uk/portal/en/theses/the-cover-time-of-random-walks-on-graph(c23c303f-a6a2-4489-a059-4ade7c118106).html.
Повний текст джерелаStreib, Noah Sametz. "Planar and hamiltonian cover graphs." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/43744.
Повний текст джерелаCarney, Nicholas. "Roman Domination Cover Rubbling." Digital Commons @ East Tennessee State University, 2019. https://dc.etsu.edu/etd/3617.
Повний текст джерелаSinkovic, John Henry. "The Minimum Rank Problem for Outerplanar Graphs." BYU ScholarsArchive, 2013. https://scholarsarchive.byu.edu/etd/3722.
Повний текст джерелаHassan-Shafique, Khurram. "PARTITIONING A GRAPH IN ALLIANCES AND ITS APPLICATION TO DATA CLUSTERING." Doctoral diss., University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4152.
Повний текст джерелаCornet, Alexis. "Algorithmes et résultats de complexité pour des problèmes de graphes avec contraintes additionnelles." Thesis, Université Clermont Auvergne (2017-2020), 2018. http://www.theses.fr/2018CLFAC034/document.
Повний текст джерелаOosthuizen, Joubert. "Random walks on graphs." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/86244.
Повний текст джерелаCamby, Eglantine. "Connecting hitting sets and hitting paths in graphs." Doctoral thesis, Universite Libre de Bruxelles, 2015. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209048.
Повний текст джерелаLevy, Eythan. "Approximation algorithms for covering problems in dense graphs." Doctoral thesis, Universite Libre de Bruxelles, 2009. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210359.
Повний текст джерелаКниги з теми "Cover graph"
NoteBooks, Sappuris. Graph Paper, Magenta Cover. Independently Published, 2021.
Знайти повний текст джерелаPress, Mockup. Graph Notebook: Hardcover Graph Notebook with Retro Style Cover. Independently Published, 2021.
Знайти повний текст джерелаPublishing, Karabella. Graph Paper: 5x5 Blank Graph Paper with Angel on Cover. Independently Published, 2018.
Знайти повний текст джерелаMagic, Handwriter. Graph Paper Notebook: Beautiful Soft Cover. Independently Published, 2020.
Знайти повний текст джерелаNoteBooks, Sappuris. Graph Paper Abstract Halftone Background Cover. Independently Published, 2021.
Знайти повний текст джерелаSunny Days Sunny Days School Room. Graph Paper Notepad: 5x5 Graph Ruled Squared Graphing Paper with Coordinate Graph Point Cover. Independently Published, 2019.
Знайти повний текст джерелаbooks, touchich. Graph Paper Composition 5x5: Size 6*9,120 Graph Pages ,matte Cover. Independently Published, 2020.
Знайти повний текст джерелаЧастини книг з теми "Cover graph"
Atienza, Nieves, Natalia de Castro, Carmen Cortés, et al. "Cover Contact Graphs." In Graph Drawing. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-77537-9_18.
Повний текст джерелаAngel, Eric, Evripidis Bampis, Bruno Escoffier, and Michael Lampis. "Parameterized Power Vertex Cover." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53536-3_9.
Повний текст джерелаFomin, Fedor V., and Torstein J. F. Strømme. "Vertex Cover Structural Parameterization Revisited." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53536-3_15.
Повний текст джерелаKourie, Derrick G., and Bruce W. Watson. "Case Study: Lattice Cover Graph Construction." In The Correctness-by-Construction Approach to Programming. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27919-5_6.
Повний текст джерелаIvković, Zoran, and Errol L. Lloyd. "Fully dynamic maintenance of vertex cover." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-57899-4_44.
Повний текст джерелаWang, Liang, and Jianxin Zhao. "Computation Graph." In Architecture of Advanced Numerical Analysis Systems. Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-8853-5_6.
Повний текст джерелаKneis, Joachim, Alexander Langer, and Peter Rossmanith. "Improved Upper Bounds for Partial Vertex Cover." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92248-3_22.
Повний текст джерелаChen, Jianer, Iyad A. Kanj, and Weijia Jia. "Vertex Cover: Further Observations and Further Improvements." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46784-x_30.
Повний текст джерелаKılıç, Baran, Can Özturan, and Alper Şen. "Analyzing Large-Scale Blockchain Transaction Graphs for Fraudulent Activities." In Big Data and Artificial Intelligence in Digital Finance. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-94590-9_14.
Повний текст джерелаFellows, Michael R., Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, and Saket Saurabh. "Graph Layout Problems Parameterized by Vertex Cover." In Algorithms and Computation. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92182-0_28.
Повний текст джерелаТези доповідей конференцій з теми "Cover graph"
Guan, Renxiang, Zihao Li, Chujia Song, Guo Yu, Xianju Li, and Ruyi Feng. "S2RC-GCN: A Spatial-Spectral Reliable Contrastive Graph Convolutional Network for Complex Land Cover Classification Using Hyperspectral Images." In 2024 International Joint Conference on Neural Networks (IJCNN). IEEE, 2024. http://dx.doi.org/10.1109/ijcnn60899.2024.10650629.
Повний текст джерелаKrishnan, Sivaram, Jihong Park, Gregory Sherman, Benjamin Campbell, and Jinho Choi. "Graph Koopman Autoencoder for Predictive Covert Communication Against UAV Surveillance." In 2024 IEEE 99th Vehicular Technology Conference (VTC2024-Spring). IEEE, 2024. http://dx.doi.org/10.1109/vtc2024-spring62846.2024.10683140.
Повний текст джерелаStephans, Larry C. "The Design of Masonry/Plastic Lining Composite Structures." In CORROSION 1997. NACE International, 1997. https://doi.org/10.5006/c1997-97363.
Повний текст джерелаWerner, Peter, Alexandre Amice, Tobia Marcucci, Daniela Rus, and Russ Tedrake. "Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs." In 2024 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2024. http://dx.doi.org/10.1109/icra57147.2024.10610005.
Повний текст джерелаGusev, Vasily Vasilievich. "Game of vertex cover of a graph." In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-56.
Повний текст джерелаMariano, Matheus Monteiro, Érica Ferreira Souza, André Takeshi Endo, and Nandamudi L. Vijaykumar. "A comparative study of algorithms for generating switch cover test sets." In XV Simpósio Brasileiro de Qualidade de Software. Sociedade Brasileira de Computação - SBC, 2016. http://dx.doi.org/10.5753/sbqs.2016.15122.
Повний текст джерелаBotler, Fábio, and Luiz Hoffmann. "Decomposition of (2k+1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k+1." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/etc.2020.11078.
Повний текст джерелаGangatharan, Venkat Narayanan, Suresh Suseela, and Kala Rukhmoni. "On 2−simple graphoidal cover of a graph." In 1ST INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2020. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0025497.
Повний текст джерелаDivsalar, Dariush, and Lara Dolecek. "Graph cover ensembles of non-binary protograph LDPC codes." In 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6283972.
Повний текст джерелаSkachek, Vitaly. "Characterization of graph-cover pseudocodewords of codes over F3." In 2010 IEEE Information Theory Workshop (ITW 2010). IEEE, 2010. http://dx.doi.org/10.1109/cig.2010.5592884.
Повний текст джерелаЗвіти організацій з теми "Cover graph"
Lundgren, J. R., and John S. Maybee. Graphs and Matrices: Combinatorial Analysis, Competitions, Covers and Ranks. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada280480.
Повний текст джерелаRosenblatt, David, Henry Mooney, Khamal Clayton, et al. Open configuration options Caribbean Economics Quarterly: Volume 11: Issue 1, February 2022: Year in Review in Graphs: Economic Story of 2021 in a Series of Graphs. Inter-American Development Bank, 2022. http://dx.doi.org/10.18235/0004018.
Повний текст джерелаNieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 18. Hilbert Press, 2018. http://dx.doi.org/10.56441/hilbertpress.1818.9585.
Повний текст джерелаNieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 20. Hilbert Press, 2020. http://dx.doi.org/10.56441/hilbertpress.2048.3738.
Повний текст джерелаNieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 19. Hilbert Press, 2019. http://dx.doi.org/10.56441/hilbertpress.1927.9364.
Повний текст джерелаTurgeon, Mathieu. Causal Modeling with Regression Discontinuity Designs (RDD). Instats Inc., 2023. http://dx.doi.org/10.61700/s3nl5lfnmruqw469.
Повний текст джерелаTurgeon, Mathieu. Causal Modeling with Regression Discontinuity Designs (RDD). Instats Inc., 2023. http://dx.doi.org/10.61700/o6e22r1sh4h7m469.
Повний текст джерелаHeitman, Joshua L., Alon Ben-Gal, Thomas J. Sauer, Nurit Agam, and John Havlin. Separating Components of Evapotranspiration to Improve Efficiency in Vineyard Water Management. United States Department of Agriculture, 2014. http://dx.doi.org/10.32747/2014.7594386.bard.
Повний текст джерелаSprague, Joshua, David Kushner, James Grunden, Jamie McClain, Benjamin Grime, and Cullen Molitor. Channel Islands National Park Kelp Forest Monitoring Program: Annual report 2014. National Park Service, 2022. http://dx.doi.org/10.36967/2293855.
Повний текст джерелаSaltus, Christina, Molly Reif, and Richard Johansen. waterquality for ArcGIS Pro Toolbox. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/42240.
Повний текст джерела