scientific article; zbMATH DE number 6850484
From MaRDI portal
zbMath1403.68157MaRDI QIDQ4608071
David Coudert, Alexandru Popa, Guillaume Ducoffe
Publication date: 15 March 2018
Full work available at URL: http://dl.acm.org/citation.cfm?id=3175480
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Iterated Type Partitions, Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension, A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs, Fast approximation and exact computation of negative curvature parameters of graphs, An Adaptive Version of Brandes' Algorithm for Betweenness Centrality, Efficient and Adaptive Parameterized Algorithms on Modular Decompositions, Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments, Low-congestion shortcut and graph parameters, Unnamed Item, Unnamed Item, Unnamed Item, Parameterized aspects of triangle enumeration, When can graph hyperbolicity be computed in linear time?, Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs, Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
