Gotowa bibliografia na temat „Bipartite Helly graphs”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Bipartite Helly graphs”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Bipartite Helly graphs"
Eguia, Martiniano, i Francisco Juan Soulignac. "Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration". Discrete Mathematics & Theoretical Computer Science Vol. 15 no. 1, Graph and Algorithms (10.02.2013). http://dx.doi.org/10.46298/dmtcs.626.
Pełny tekst źródłaBulavka, Denys, Martin Tancer i Mykhaylo Tyomkyn. "Weak Saturation of Multipartite Hypergraphs". Combinatorica, 27.07.2023. http://dx.doi.org/10.1007/s00493-023-00049-0.
Pełny tekst źródłaDalfó, Cristina, Clemens Huemer i Julián Salas. "The Degree/Diameter Problem in Maximal Planar Bipartite graphs". Electronic Journal of Combinatorics 23, nr 1 (18.03.2016). http://dx.doi.org/10.37236/4468.
Pełny tekst źródłaRozprawy doktorskie na temat "Bipartite Helly graphs"
Bénéteau, Laurine. "Médians de graphes : algorithmes, connexité et axiomatique". Electronic Thesis or Diss., Aix-Marseille, 2022. http://www.theses.fr/2022AIXM0512.
Pełny tekst źródłaThe median problem is one of the most investigated problem in metric graph theory. We will start by studying this problem in median graphs. We present a linear time algorithm based on the majority rule which characterize the median in median graphs and on a fast computation of the parallelism classes of the edges (the \Theta-classes) via LexBFS which is a particular breadth first search algorithm.We also provide linear time algorithms to compute the median set in the l_1-cube complexes of median graphs and in event structures. Then, we provide a characterization of the graphs with connected medians in the pth power of the graph and provide a polynomial method to check if a graph is a G^p-connected median graph, extending a result of Bandelt and Chepoi (case p=1). We use this characterization to prove that some important graph classes in metric graph theory have G2-connected medians, such as bipartite Helly graphs and bridged graphs. We will also studied the axiomatic aspect of the median function by investigating the ABC-problem, which determine the graphs (named ABC-graphs) in which the median function is the only consensus function verifying three simples axioms (A) Anonymat, (B) Betweeness and (C) Consistency. We show that modular graphs with G2-connected medians are ABC-graphs and define new axioms allowing us to characterize the median function on some graph classes. For example the graphs with connected medians (including Helly graphs). We also show that a known class of ABC-graphs (graphs satisfying the pairing property) is a proper subclass of bipartite Helly graphs and we investigate their recognition
Streszczenia konferencji na temat "Bipartite Helly graphs"
Kolberg, Fabricio Schiavon, Marina Groshaus, André Luiz Pires Guedes i Renato Carmo. "Results on Circular-Arc Bigraphs". W I Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2016.9846.
Pełny tekst źródła