Sparse graphs
Reduced-size formulations for metric and cut polyhedra in sparse graphs
... Note that the extended formulations RMET(K n ) and RMETP(K n ) described in Section 2 respectively for MET(G) and METP(G) have O(nm) constraints and O(n 2 ) variables. Hence, even for special sparse graphs ...
13
Data-Compression for Parametrized Counting Problems on Sparse Graphs
... size compactor, that is applicable to a wide family of problems of graphs. 1.1 General context Algorithmic meta-theorems. Parameterized complexity has been proposed as a multi- variable framework for coping with ...
14
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
... of sparse graphs, where they have been at the heart of the recent developments of meta-theorems for obtaining linear and polynomial kernels on graphs on surfaces [4], minor-free graphs [17], ...
24
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
... degenerate graphs for any c ≥ ...dense graphs [11], it follows that sparse graphs constitute the border for the existence of polynomial ...on sparse graphs? Since considering as ...
14
Fast Beeping Protocols for Deterministic MIS and ($∆ + 1$)-Coloring in Sparse Graphs (Extended Version)
... growth-bounded graphs (GBG). These are graphs where, for any given node v and integer r, the number of nodes in any independent set (see definition in ...degree graphs, trees, planar graphs, ...
15
$(k,1)$-coloring of sparse graphs
... Vertex decomposi- tions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. submitted[r] ...
12
Efficient Simulation of Sparse Graphs of Point Processes
... Our aim is to derive a new simulation algorithm, which generalises the algorithm of [3] to general multivariate point processes that are not necessarily Markovian, by exploiting the underlying network between the types, ...
29
Spectral inference methods on sparse graphs : theory and applications
... In this dissertation, we use methods derived from the statistical physics of disordered systems to design and study new algorithms for inference on graphs. Our focus is on spectral methods, based on certain ...
256
Weighted Coloring on P4-sparse Graphs
... There are a number of optimization problems that can be solved in polynomial time on P 4 -sparse graphs [10], [12]. The algorithms that solve these problems usually calculate the desired parameter in a ...
7
The Normal Graph Conjecture for Two Classes of Sparse Graphs
... for T (G, A), and the outcome of both proceedures is clearly the same. 5 Concluding Remarks In this work, we verify the Normal Graph Conjecture for two classes of sparse graphs, 1-trees and cacti. This ...
22
Partitioning sparse graphs into an independent set and a graph with bounded size components
... a sparse graph G, measured in terms of mad(G), so that each part induces a graph with bounded component ...planar graphs into parts that induce graphs with bounded maximum degree; we refer the ...
25
Vertex partition of sparse graphs
... H-free graphs has bounded clique-width if and only if H is an induced subgraph of ...H2)-free graphs, but until recently [22] it was not even known whether the number of missing cases was ...
183
Strong edge coloring sparse graphs
... This question is hard to answer even in restricted settings like the class of planar subcubic graphs with no triangle (see e.g. [ 9 ]). Therefore, many works focus instead on exhibiting upper bounds on the strong ...
7
2-Distance Coloring of Sparse Graphs
... Theorem 1.1 ([ 1 ]) Every planar graph G with g(G) ≥ 15 and ∆(G) ≥ 4 admits a 2-distance (∆(G) + 1)-coloring. Note that this result was later extended to list-coloring [ 2 ]. Dolama and Sopena [ 3 ] proved a more general ...
7
Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities
... Pr(z ij = 1|(w ` ) `=1,2,... ) = 1 − e −2w i w j (2) where the (w i , θ i ) i=1,2,... are the points of a Poisson point process on R 2 + . The parameters w i > 0 can be interpreted as sociability parameters. Depending ...
30
Revisiting the Bethe-Hessian: Improved Community Detection in Sparse Heterogeneous Graphs
... matrix D −1 A is claimed inappropriate as a spectral community detection matrix for sparse graphs. This is in fact a slight overstatement: as already observed in [20], as the graph under study gets sparser, ...
15
Community Detection in Sparse Realistic Graphs: Improving the Bethe Hessian
... ABSTRACT This article improves over the recently proposed Bethe Hes- sian matrix for community detection on sparse graphs, as- suming here a more realistic setting where node degrees are inhomogeneous. We ...
6
Mapping sparse signed graphs to (K_{2k} , M )
... signed graphs is relatively new subject, through the connection with the homomorphisms of 2-edge-colored graphs, which are largely studied, some earlier bounds are already ...from sparse ...
35
Metric Dimension: from Graphs to Oriented Graphs
... undirected graphs to oriented graphs To avoid any confusion, let us recall that an orientation D of an undirected graph G is obtained when every edge uv of G is oriented either from u to v (resulting in the ...
12
Sparse polynomial interpolation: sparse recovery, super resolution, or Prony?
... naive sparse recovery LP-approach does not offer such a ...for sparse interpolation, which also recovers the exact decomposition but from less point evaluations and with no geometric spacing ...
27