Suchergebnisse - G.2 DISCRETE MATHEMATICS. Graph algorithms

Exact values for three domination-like problems in circular and infinite grid graphs of small height von Bouznif, Marwane, Darlay, Julien, Moncel, Julien, Preissmann, Myriam

“… We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs of given height …”
Volltext

ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G 2 -connected medians von Bénéteau, Laurine, Chalopin, Jérémie, Chepoi, Victor, Vaxès, Yann

“… In this paper, we show that modular graphs with $G^2$-connected medians (in particular, bipartite Helly graphs) are ABC-graphs …”
Volltext

An O(|E(G)|2) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs von Feng, Xing, Zhang, Lianzhu, Zhang, Mingzu

“… Then, we design an O ( | E ( G ) | 2 ) algorithm for recognizing Pfaffian graphs in this class and constructs a Pfaffian orientation if the graph is Pfaffian …”
Volltext

Graphs with $$G^p$$-connected medians von Bénéteau, Laurine, Chalopin, Jérémie, Chepoi, Victor, Vaxès, Yann

“… (and thus chordal graphs), graphs with convex balls, bucolic graphs, and bipartite absolute retracts, have $G^2$-connected medians …”
Volltext

GMap: Visualizing graphs and clusters as maps von Gansner, E.R., Yifan Hu, Kobourov, S.

“… In this paper, we describe GMap, a practical algorithm for visualizing relational data with geographic-like maps …”
Volltext

Paired domination versus domination and packing number in graphs von Dettlaff, Magda, Gözüpek, Didem, Raczek, Joanna

“… ) . In this paper, we prove that it is NP-hard to determine whether γ pr ( G ) = 2 γ ( G ) even for bipartite graphs …”
Volltext

Graphs with convex balls von Chalopin, Jérémie, Chepoi, Victor, Giocanti, Ugo

“… ) and Farber and Jamison (Discrete Math 66: 231–247, 1987). CB-graphs and CB-groups generalize systolic (alias bridged …”
Volltext

O(VE) time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with large girth von Zaker, Manouchehr

“… We first obtain an O(VE) algorithm to determine the Grundy number of block graphs i.e. graphs in which every biconnected component is a complete graph …”
Volltext

Hardness and algorithms for rainbow connection von Chakraborty, Sourav, Fischer, Eldar, Matsliah, Arie, Yuster, Raphael

“… An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors …”
Volltext

Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs von Lu, Changhong, Ye, Qingjie, Zhu, Chengru

“… (MWDRS) problem is finding a doubly resolving set with minimum total weight. We establish a linear time algorithm for the MWDRS problem of all graphs in which each block is complete graph or cycle …”
Volltext

Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals von Colin de Verdière, Éric

“… ) and has a fixed number  t of terminals. The running time is a polynomial of degree  O ( g 2 + g t ) in the input size. In the planar case, our result corrects an error in an extended abstract by Bentz …”
Volltext

Algorithmic and complexity aspects of problems related to total Roman domination for graphs von Poureidi, Abolfazl, Rad, Nader Jafari

“… ) . The Roman domination number of a graph G , denoted by γ R ( G ) , is the minimum weight of a Roman dominating function on G . A connected (respectively, total …”
Volltext

Minimum k -path vertex cover von BRESAR, Bostjan, KARDOS, Frantisek, KATRENIC, Ján, SEMANISIN, Gabriel

“… ) and provide several estimations and exact values of ψ k ( G ) . We also prove that ψ 3 ( G ) ≤ ( 2 n + m ) / 6 , for every graph G with n vertices and m edges …”
Volltext

Computing densest k-subgraph with structural parameters von Hanaka, Tesshu

“… deletion number, respectively. Furthermore, we give a 2-approximation 2 tc ( G ) / 2 n O ( 1 ) -time algorithm where tc …”
Volltext

Hybrid intermittent fault diagnosis of general graphs von Yang, Lulu, Zhou, Shuming, Zheng, Weixing

“… Furthermore, we propose a HIFPD-MM* algorithm, which possesses a time complexity of O(k×|V(G)|⋅(Δ(G))2), where k …”
Volltext

Fast Algorithms for Minimum Homology Basis von Dhar, Amritendu, Natarajan, Vijay, Rathod, Abhishek

“… . This problem has been extensively studied in the last few years. For general complexes, the current best deterministic algorithm, by Dey et al. (LATIN 2018 …”
Volltext

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern von Focke, Jacob, Hörsch, Florian, Li, Shaohua, Marx, Dániel

“… $$f(t,g)n^{O(\sqrt{g^2+gt+t})}$$ f ( t , g ) n O ( g 2 + g t + t ) . Cohen-Addad et al. [ JACM , 2021] proved a matching lower bound showing that the exponent of n is essentially best possible …”
Volltext

Exponential Domination in Subcubic Graphs von Bessy, Stéphane, Ochem, Pascal, Rautenbach, Dieter

“… As a natural variant of domination in graphs, Dankelmann et al. [Domination with exponential decay, Discrete Math. 309 (2009) 5877-5883 …”
Volltext

Identifying Codes in Line Graphs von Foucaud, Florent, Gravier, Sylvain, Naserasr, Reza, Parreau, Aline, Valicov, Petru

“… We also prove that the upper bound γID(L(G))≤2|V(G)|−5, where L(G) is the line graph of G, holds (with two exceptions …”
Volltext

Monitoring the edges of a graph using distances von Foucaud, Florent, Kao, Shih-Shun, Klasing, Ralf, Miller, Mirka, Ryan, Joe

“… We introduce a new graph-theoretic concept in the area of network monitoring. A set M of vertices of a graph G is a distance-edge-monitoring set if for every …”
Volltext