Добірка наукової літератури з теми "Stable graph"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Stable graph".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Stable graph"
Abudayah, Mohammad, and Omar Alomari. "Semi Square Stable Graphs." Mathematics 7, no. 7 (July 3, 2019): 597. http://dx.doi.org/10.3390/math7070597.
Повний текст джерелаWu, Pu, Huiqin Jiang, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami, Zehui Shao, and Lutz Volkmann. "Independent Domination Stable Trees and Unicyclic Graphs." Mathematics 7, no. 9 (September 5, 2019): 820. http://dx.doi.org/10.3390/math7090820.
Повний текст джерелаKayali, Moe, and Dan Suciu. "Quasi-Stable Coloring for Graph Compression." Proceedings of the VLDB Endowment 16, no. 4 (December 2022): 803–15. http://dx.doi.org/10.14778/3574245.3574264.
Повний текст джерелаLiu, Ye. "On Chromatic Functors and Stable Partitions of Graphs." Canadian Mathematical Bulletin 60, no. 1 (March 1, 2017): 154–64. http://dx.doi.org/10.4153/cmb-2016-047-3.
Повний текст джерелаOsztényi, József. "A study of the neighborhood complex of $-stable Kneser graphs." Gradus 8, no. 3 (2021): 179–86. http://dx.doi.org/10.47833/2021.3.csc.006.
Повний текст джерелаTolue, Behnaz. "The stable subgroup graph." Boletim da Sociedade Paranaense de Matemática 36, no. 3 (July 1, 2018): 129–39. http://dx.doi.org/10.5269/bspm.v36i3.31678.
Повний текст джерелаPask, David, Adam Sierakowski, and Aidan Sims. "Structure theory and stable rank for C*-algebras of finite higher-rank graphs." Proceedings of the Edinburgh Mathematical Society 64, no. 4 (October 4, 2021): 822–47. http://dx.doi.org/10.1017/s0013091521000626.
Повний текст джерелаHalevi, Yatir, Itay Kaplan, and Saharon Shelah. "Infinite stable graphs with large chromatic number." Transactions of the American Mathematical Society 375, no. 3 (December 21, 2021): 1767–99. http://dx.doi.org/10.1090/tran/8570.
Повний текст джерелаKoh, Zhuan Khye, and Laura Sanità. "Stabilizing Weighted Graphs." Mathematics of Operations Research 45, no. 4 (November 2020): 1318–41. http://dx.doi.org/10.1287/moor.2019.1034.
Повний текст джерелаJardine, J. F. "Stable Components and Layers." Canadian Mathematical Bulletin 63, no. 3 (October 23, 2019): 562–76. http://dx.doi.org/10.4153/s000843951900064x.
Повний текст джерелаДисертації з теми "Stable graph"
Harris, Elizabeth Marie. "Global Domination Stable Graphs." Digital Commons @ East Tennessee State University, 2012. https://dc.etsu.edu/etd/1476.
Повний текст джерелаConnelly, Abram. "Numerical evidence for phase transitions of NP-complete problems for instances drawn from Lévy-stable distributions." Thesis, University of St Andrews, 2011. http://hdl.handle.net/10023/2533.
Повний текст джерелаDonato, Karen Ann Ehnot. "The kinetics of a methyl methacrylate polymerization initiated by the stable free radicals in irradiated polytetrafluoroethylene and properties of the resultant graft polymer." Ohio : Ohio University, 1987. http://www.ohiolink.edu/etd/view.cgi?ohiou1171670342.
Повний текст джерелаCotté, Grégoire. "d-extensibles, d-bloqueurs et d-transversaux de problèmes d'optimisation combinatoire." Thesis, Paris, CNAM, 2016. http://www.theses.fr/2016CNAM1037/document.
Повний текст джерелаIn this thesis, we study three types of problems : the d-extensibles sets, the d-blockers and the d-transversals.In a graph G, a d-extensible set of maximum independent sets is a subset of vertices of G such that every stable set of cardinality d in the subgraph restricted to the d-extensible set can be extented to a maximum stable set of G using only vertices that do not belong to the d-extensible set. We study d-extensible sets of mxaimum cardinality of stable sets in bipartite graphs. We show some structural properties and we determine a lower bound of the maximum cardinality of a d-extensible set. We consider some classes of graph where finding an optimum d-extensible set can be done in polynomial time. Then, we study the d-extensibles sets of stable sets in trees. We prove some properties on the structures of the d-extensibles sets and we determine another lower bound of the maximum cardinality of a d-extensible set. Finaly, we study somme classes of tree where a d-extensible sets of maximum cardinality can be done in polynomial time.In a graph G, a d-blocker is a subset of vertices such that, if removed, a maximum stable set of the resulting subgraph is of cardinality at most the cardinality of a maximum stable set of G minus d. We study d-blocker of minimal cost of stable sets in tree.We prove a caracterisation of d-blockers in tree and we study a particular classe of trees where computing a d-blocker of minimal cost of stable sets can be done in polynomial time.Let Pi be an optimisation problem on a finite set of elements. A d-transversal of Pi is a subset of elements such that the intersection between the d-transversal and every optimal solution of Pi contains at lest d elements. We propose an approach to compute d-transversal of any optimisation problem modelised by mathematical program with binary variables. We use a contraints generation approach. We compare two variations of this approach on randomly generated graph by computing d-transversals of stables sets and d-transversals of matching
Lagoutte, Aurélie. "Interactions entre les Cliques et les Stables dans un Graphe." Thesis, Lyon, École normale supérieure, 2015. http://www.theses.fr/2015ENSL1012/document.
Повний текст джерелаThis thesis is concerned with different types of interactions between cliques and stable sets, two very important objects in graph theory, as well as with the connections between these interactions. At first, we study the classical problem of graph coloring, which can be stated in terms of partioning the vertices of the graph into stable sets. We present a coloring result for graphs with no triangle and no induced cycle of even length at least six. Secondly, we study the Erdös-Hajnal property, which asserts that the maximum size of a clique or a stable set is polynomial (instead of logarithmic in random graphs). We prove that the property holds for graphs with no induced path on k vertices and its complement.Then, we study the Clique-Stable Set Separation, which is a less known problem. The question is about the order of magnitude of the number of cuts needed to separate all the cliques from all the stable sets. This notion was introduced by Yannakakis when he studied extended formulations of the stable set polytope in perfect graphs. He proved that a quasi-polynomial number of cuts is always enough, and he asked if a polynomial number of cuts could suffice. Göös has just given a negative answer, but the question is open for restricted classes of graphs, in particular for perfect graphs. We prove that a polynomial number of cuts is enough for random graphs, and in several hereditary classes. To this end, some tools developed in the study of the Erdös-Hajnal property appear to be very helpful. We also establish the equivalence between the Clique-Stable set Separation problem and two other statements: the generalized Alon-Saks-Seymour conjecture and the Stubborn Problem, a Constraint Satisfaction Problem
Pastor, Lucas. "Coloration, ensemble indépendant et structure de graphe." Thesis, Université Grenoble Alpes (ComUE), 2017. http://www.theses.fr/2017GREAM071/document.
Повний текст джерелаThis thesis deals with graph coloring, list-coloring, maximum weightstable set (shortened as MWSS) and structural graph theory.First, we provide polynomial-time algorithms for the 4-coloring problem insubclasses of $P_6$-free graphs. These algorithms rely on a preciseunderstanding of the structure of these classes of graphs for which we give afull description.Secondly, we study the list-coloring conjecture and prove that for anyclaw-free perfect graph with clique number bounded by 4, the chromatic numberand the choice number are equal. This result is obtained by using adecomposition theorem for claw-free perfect graphs, a structural description ofthe basic graphs of this decomposition and by using Galvin's famous theorem.Next by using the structural description given in the first chapter andstrengthening other aspects of this structure, we provide polynomial-timealgorithms for the MWSS problem in subclasses of $P_6$-free and $P_7$-freegraphs.In the last chapter of the manuscript, we disprove a conjecture of De Simoneand K"orner made in 1999 related to normal graphs. Our proof is probabilisticand is obtained by the use of random graphs
Morsellino, Thomas. "Présentation et étude de quelques problèmes d’algorithmique distribuée." Thesis, Bordeaux 1, 2012. http://www.theses.fr/2012BOR14586/document.
Повний текст джерелаIn this thesis, we first present a study of several problems in the field of distributed algorithms. We provide a formal model that relies on anonymous networks. In this model, we characterize graphs in which it is possible to solve enumeration and leader election problems. This characterization is based on graph homomorphism. We introduce two algorithms with polynomial complexities that improve existing works with exponential complexities. On the other hand, we study the snapshot problem and we introduce the notion of weak snapshot. We show that there exist solutions for this problem in the context of anonymous networks. We present several results about distributed snapshots that deal with checkpoint and rollback recovery, termination detection or the cartography computation of a network. In a practical aspect, we present the conception, the development process and the implementation of these distributed snapshot algorithms within the simulation and visualization software ViSiDiA
Wang, Suyi Wang. "Analyzing data with 1D non-linear shapes using topological methods." The Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1524020976023345.
Повний текст джерелаPassuello, Alberto. "Semidefinite programming in combinatorial optimization with applications to coding theory and geometry." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00948055.
Повний текст джерелаJin, Yan. "Hybrid metaheuristic algorithms for sum coloring and bandwidth coloring." Thesis, Angers, 2015. http://www.theses.fr/2015ANGE0062/document.
Повний текст джерелаThe minimum sum coloring problem (MSCP) and the bandwidth coloring problem (BCP) are two important generalizations of the classical vertex coloring problem with numerous applications in diverse domains, including VLSI design, scheduling, resource allocation and frequency assignment in mobile networks, etc. Since the MSCP and BCP are NP-hard problems, heuristics and metaheuristics are practical solution methods to obtain high quality solutions in an acceptable computing time. This thesis is dedicated to developing effective hybrid metaheuristic algorithms for the MSCP and BCP. For the MSCP, we present two memetic algorithms which combine population-based evolutionary search and local search. An effective algorithm for maximum independent set is devised for generating initial solutions. For the BCP, we propose a learning-based hybrid search algorithm which follows a cooperative framework between an informed construction procedure and a local search heuristic. The proposed algorithms are evaluated on well-known benchmark instances and show highly competitive performances compared to the current state-of-the-art algorithms from the literature. Furthermore, the key issues of these algorithms are investigated and analyzed
Книги з теми "Stable graph"
Stable networks and product graphs. Providence, R.I: American Mathematical Society, 1995.
Знайти повний текст джерела1959-, Hrushovski Ehud, and Macpherson Dugald, eds. Stable domination and independence in algebraically closed valued fields. Cambridge: Cambridge University Press, 2008.
Знайти повний текст джерелаMikov, Aleksandr. Generalized graphs and grammars. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1013698.
Повний текст джерелаGdanskiy, Nikolay. Fundamentals of the theory and algorithms on graphs. ru: INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/978686.
Повний текст джерелаSeslavin, Andrey. Theory of automatic control. Linear, continuous systems. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1014654.
Повний текст джерелаKoldaev, Viktor. Theoretical and methodological aspects of the use of information technologies in education. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1014651.
Повний текст джерелаAlekseev, Valeriy. Discrete mathematics. ru: INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1172256.
Повний текст джерелаPuhal'skiy, Vitaliy. Introduction to Genetics. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1019851.
Повний текст джерелаMartynova, Tat'yana, Irina Suponickaya, Yuliya Ageeva, Igor' Gorichev, Ol'ga Koval'chukova, and Boleslavna Svetlana. Inorganic chemistry. ru: INFRA-M Academic Publishing LLC., 2023. http://dx.doi.org/10.12737/1860987.
Повний текст джерелаBalackiy, Evgeniy, Natal'ya Ekimova, Aleksandr Rudnev, and Aleksandr Gusev. New approaches to modeling economic development. ru: INFRA-M Academic Publishing LLC., 2022. http://dx.doi.org/10.12737/1862597.
Повний текст джерелаЧастини книг з теми "Stable graph"
Fleiner, Tamás. "On Stable Matchings and Flows." In Graph Theoretic Concepts in Computer Science, 51–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16926-7_7.
Повний текст джерелаMüller, Haiko. "On the Stable Degree of Graphs." In Graph-Theoretic Concepts in Computer Science, 148–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34611-8_17.
Повний текст джерелаBiró, Péter, Walter Kern, Daniël Paulusma, and Péter Wojuteczky. "The Stable Fixtures Problem with Payments." In Graph-Theoretic Concepts in Computer Science, 49–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53174-7_4.
Повний текст джерелаLe, Van Bang, and Bert Randerath. "On Stable Cutsets in Line Graphs." In Graph-Theoretic Concepts in Computer Science, 263–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45477-2_24.
Повний текст джерелаGanesh, Aadityan, H. V. Vishwa Prakash, Prajakta Nimbhorkar, and Geevarghese Philip. "Disjoint Stable Matchings in Linear Time." In Graph-Theoretic Concepts in Computer Science, 94–105. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86838-3_7.
Повний текст джерелаKun, Jeremy, Brian Powers, and Lev Reyzin. "Anti-coordination Games and Stable Graph Colorings." In Algorithmic Game Theory, 122–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41392-6_11.
Повний текст джерелаKahraman, Cengiz, Alexander Bozhenyuk, and Margarita Knyazeva. "Internally Stable Set in Intuitionistic Fuzzy Graph." In Lecture Notes in Networks and Systems, 566–72. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09173-5_65.
Повний текст джерелаAndrade, Diogo V., Endre Boros, and Vladimir Gurvich. "On Graphs Whose Maximal Cliques and Stable Sets Intersect." In Optimization Problems in Graph Theory, 3–63. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94830-0_2.
Повний текст джерелаBiró, Péter, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, and Daniël Paulusma. "Solutions for the Stable Roommates Problem with Payments." In Graph-Theoretic Concepts in Computer Science, 69–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34611-8_10.
Повний текст джерелаDemange, Marc, D. de Werra, J. Monnot, and Vangelis Th Paschos. "Weighted Node Coloring: When Stable Sets Are Expensive." In Graph-Theoretic Concepts in Computer Science, 114–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36379-3_11.
Повний текст джерелаТези доповідей конференцій з теми "Stable graph"
Buzmakov, Aleksey, Sergei O. Kuznetsov, and Amedeo Napoli. "Efficient Mining of Subsample-Stable Graph Patterns." In 2017 IEEE International Conference on Data Mining (ICDM). IEEE, 2017. http://dx.doi.org/10.1109/icdm.2017.88.
Повний текст джерелаHu, Minyang, Hong Chang, Bingpeng Ma, and Shiguang Shan. "Learning Continuous Graph Structure with Bilevel Programming for Graph Neural Networks." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/424.
Повний текст джерелаKamkar, Iman, Sunil Gupta, Cheng Li, Dinh Phung, and Svetha Venkatesh. "Stable clinical prediction using graph support vector machines." In 2016 23rd International Conference on Pattern Recognition (ICPR). IEEE, 2016. http://dx.doi.org/10.1109/icpr.2016.7900148.
Повний текст джерелаHu, Nan, Raif Rustamov, and Leonidas Guibas. "Stable and Informative Spectral Signatures for Graph Matching." In 2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2014. http://dx.doi.org/10.1109/cvpr.2014.296.
Повний текст джерелаCervino, Juan, Luana Ruiz, and Alejandro Ribeiro. "Training Stable Graph Neural Networks Through Constrained Learning." In ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2022. http://dx.doi.org/10.1109/icassp43922.2022.9746912.
Повний текст джерелаGao, Zhan, and Elvin Isufi. "Learning Stable Graph Neural Networks via Spectral Regularization." In 2022 56th Asilomar Conference on Signals, Systems, and Computers. IEEE, 2022. http://dx.doi.org/10.1109/ieeeconf56349.2022.10051821.
Повний текст джерелаIsufi, Elvin, Andreas Loukas, and Geert Leus. "Autoregressive moving average graph filters a stable distributed implementation." In 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2017. http://dx.doi.org/10.1109/icassp.2017.7952931.
Повний текст джерелаKim, Haklin. "On the maximum stable set of a permutation graph." In the 28th annual Southeast regional conference. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/98949.99111.
Повний текст джерелаLeng, Zhiying, Jiaying Chen, Hubert P. H. Shum, Frederick W. B. Li, and Xiaohui Liang. "Stable Hand Pose Estimation under Tremor via Graph Neural Network." In 2021 IEEE Virtual Reality and 3D User Interfaces (VR). IEEE, 2021. http://dx.doi.org/10.1109/vr50410.2021.00044.
Повний текст джерелаJiang, Aimin, Beilu Ni, Jiaan Wan, and Hon Keung Kwan. "Stable ARMA Graph Filter Design via Partial Second-Order Factorization." In 2019 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE, 2019. http://dx.doi.org/10.1109/iscas.2019.8702252.
Повний текст джерелаЗвіти організацій з теми "Stable graph"
Moeller, Daniel, Ramamohan Paturi, and Moshe Hoffman. Jealousy Graphs: Structure and Complexity of Decentralized Stable Matching. Fort Belvoir, VA: Defense Technical Information Center, January 2013. http://dx.doi.org/10.21236/ada600700.
Повний текст джерелаGallagher, B. The State of the Art in Graph-Based Pattern Matching. Office of Scientific and Technical Information (OSTI), March 2006. http://dx.doi.org/10.2172/895418.
Повний текст джерелаQi, Fei, Zhaohui Xia, Gaoyang Tang, Hang Yang, Yu Song, Guangrui Qian, Xiong An, Chunhuan Lin, and Guangming Shi. A Graph-based Evolutionary Algorithm for Automated Machine Learning. Web of Open Science, December 2020. http://dx.doi.org/10.37686/ser.v1i2.77.
Повний текст джерелаStriuk, Andrii, Olena Rybalchenko, and Svitlana Bilashenko. Development and Using of a Virtual Laboratory to Study the Graph Algorithms for Bachelors of Software Engineering. [б. в.], November 2020. http://dx.doi.org/10.31812/123456789/4462.
Повний текст джерела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.
Повний текст джерелаMikhaleva, E., E. Babikova, G. Bezhashvili, M. Ilina, and I. Samkova. VALUE STREAM PROGRAM. Sverdlovsk Regional Medical College, December 2022. http://dx.doi.org/10.12731/er0618.03122022.
Повний текст джерелаСоловйов, В. М., та В. В. Соловйова. Моделювання мультиплексних мереж. Видавець Ткачук О.В., 2016. http://dx.doi.org/10.31812/0564/1253.
Повний текст джерелаShah, Ayesha, Jan Olek, and Rebecca S. McDaniel. Real Life Experience with Major Pavement Types. Purdue University, 2022. http://dx.doi.org/10.5703/1288284317371.
Повний текст джерела