Auswahl der wissenschaftlichen Literatur zum Thema „Quasi-Bipartite graph“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Quasi-Bipartite graph" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Quasi-Bipartite graph"
Ma, Junye, Qingguo Li und Hui Li. „Some properties about the zero-divisor graphs of quasi-ordered sets“. Journal of Algebra and Its Applications 19, Nr. 04 (12.06.2019): 2050074. http://dx.doi.org/10.1142/s0219498820500747.
Der volle Inhalt der QuelleAnsari-Toroghy, Habibollah, Shokoufeh Habibi und Masoomeh Hezarjaribi. „On the graph of modules over commutative rings II“. Filomat 32, Nr. 10 (2018): 3657–65. http://dx.doi.org/10.2298/fil1810657a.
Der volle Inhalt der QuelleKumar, P. Ramana Vijaya, und Dr Bhuvana Vijaya. „Applications of Hamiltonian Cycle from Quasi Spanning Tree of Faces based Bipartite Graph“. Journal of Advanced Research in Dynamical and Control Systems 11, Nr. 12-SPECIAL ISSUE (31.12.2019): 505–12. http://dx.doi.org/10.5373/jardcs/v11sp12/20193245.
Der volle Inhalt der QuelleNaji Hameed, Zainab, und Hiyam Hassan Kadhem. „On Degree Topology and Set-T_0 space“. Wasit Journal of Computer and Mathematics Science 1, Nr. 4 (31.12.2022): 213–19. http://dx.doi.org/10.31185/wjcm.91.
Der volle Inhalt der QuelleRowlinson, Peter. „More on graphs with just three distinct eigenvalues“. Applicable Analysis and Discrete Mathematics 11, Nr. 1 (2017): 74–80. http://dx.doi.org/10.2298/aadm161111033r.
Der volle Inhalt der QuelleYu, Guidong, Gaixiang Cai, Miaolin Ye und Jinde Cao. „Energy Conditions for Hamiltonicity of Graphs“. Discrete Dynamics in Nature and Society 2014 (2014): 1–6. http://dx.doi.org/10.1155/2014/305164.
Der volle Inhalt der QuelleLai, Xinsheng, Yuren Zhou, Xiaoyun Xia und Qingfu Zhang. „Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems“. Evolutionary Computation 25, Nr. 4 (Dezember 2017): 707–23. http://dx.doi.org/10.1162/evco_a_00200.
Der volle Inhalt der QuelleChen, Junpu, und Hong Xie. „An Online Learning Approach to Sequential User-Centric Selection Problems“. Proceedings of the AAAI Conference on Artificial Intelligence 36, Nr. 6 (28.06.2022): 6231–38. http://dx.doi.org/10.1609/aaai.v36i6.20572.
Der volle Inhalt der QuelleZhao, Pan, Wenlei Guo, Datong Xu, Zhiliang Jiang, Jie Chai, Lijun Sun, He Li und Weiliang Han. „Hypergraph-based resource allocation for Device-to-Device underlay H-CRAN network“. International Journal of Distributed Sensor Networks 16, Nr. 8 (August 2020): 155014772095133. http://dx.doi.org/10.1177/1550147720951337.
Der volle Inhalt der QuelleGröpl, Clemens, Stefan Hougardy, Till Nierhoff und Hans Jürgen Prömel. „Steiner trees in uniformly quasi-bipartite graphs“. Information Processing Letters 83, Nr. 4 (August 2002): 195–200. http://dx.doi.org/10.1016/s0020-0190(01)00335-0.
Der volle Inhalt der QuelleDissertationen zum Thema "Quasi-Bipartite graph"
Pisanu, Francesco. „On box-total dual integrality and total equimodularity“. Electronic Thesis or Diss., Paris 13, 2023. http://www.theses.fr/2023PA131044.
Der volle Inhalt der QuelleIn this thesis, we study box-totally dual integral (box-TDI) polyhedra associated with severalproblems and totally equimodular matrices. Moreover, we study the complexity of some funda-mental questions related to them.We start by considering totally equimodular matrices, which are matrices such that, forevery subset of linearly independent rows, all nonsingular maximal submatrices have the samedeterminant in absolute value. Despite their similarities with totally unimodular matrices, wehighlight several differences, even in the case of incidence and adjacency matrices of graphs.As is well-known, the incidence matrix of a given graph is totally unimodular if and only if thegraph is bipartite. However, the total equimodularity of an incidence matrix depends on whetherwe consider the vertex-edge or the edge-vertex representation. We provide characterizations forboth cases. As a consequence, we prove that recognizing whether a given polyhedron is box-TDIis a co-NP-complete problem.Characterizing the total unimodularity or total equimodularity of the adjacency matrix of agiven bipartite graph remains unsolved, while we solved the corresponding problem in the case oftotal equimodularity when the graph is nonbipartite.In a later part of this work, we characterize the graphs for which the perfect matching polytope(PMP) is described by trivial inequalities and the inequalities corresponding to tight cuts. Tightcuts are defined as cuts that share precisely one edge with each perfect matching. We thenprove that any graph for which the corresponding PMP is box-TDI belongs to this class. Asa consequence, it turns out that recognizing whether the PMP is box-TDI is a polynomial-timeproblem. However, we provide several counterexamples showing that this class of graphs does notguarantee the box-TDIness of the PMP.Lastly, we present necessary conditions for the box-TDIness of the edge cover polytope andcharacterize the box-TDIness of the extendable matching polytope, which is the convex hull ofthe matchings included in a perfect matching
Buchteile zum Thema "Quasi-Bipartite graph"
„Quasi-biclique Detection from Bipartite Graphs“. In Network Data Mining and Analysis, 79–112. WORLD SCIENTIFIC, 2018. http://dx.doi.org/10.1142/9789813274969_0005.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Quasi-Bipartite graph"
Zhu, Na. „Signature of Quasi-Complete Graphs and Quasi-Complete Bipartite Graphs“. In 2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD). IEEE, 2018. http://dx.doi.org/10.1109/fskd.2018.8686948.
Der volle Inhalt der QuelleEpishin, Vladlen I. „Studying Fault Tolerance of Bipartite Homogeneous Minimal Quasi-Complete Graphs Using Cisco Packet Tracer“. In 2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus). IEEE, 2021. http://dx.doi.org/10.1109/elconrus51938.2021.9396232.
Der volle Inhalt der Quelle