Smallest-last ordering and clustering and graph coloring algorithms
From MaRDI portal
Publication:3765255
Recommendations
Cited in
(72)- Cost minimization in wireless networks with a bounded and unbounded number of interfaces
- Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna
- Approximation algorithms for the weighted independent set problem in sparse graphs
- Relaxed approximate coloring in exact maximum clique search
- Targeted \(k\)-node collapse problem: towards understanding the robustness of local \(k\)-core structure
- Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees
- Location-oblivious distributed unit disk graph coloring
- 2-coloring number revisited
- Parsimonious formulations for low-diameter clusters
- Finding and counting given length cycles
- On two coloring problems in mixed graphs
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families
- Minimum degree orderings
- Lower bounds for on-line graph coloring
- OVSF-CDMA code assignment in wireless ad hoc networks
- Computing inductive vertex orderings
- A constructive arboricity approximation scheme
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
- Counting Homomorphic Cycles in Degenerate Graphs
- Cost Minimisation in Multi-interface Networks
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Bisectored unit disk graphs
- Graph signatures: identification and optimization
- Cluster analysis and mathematical programming
- scientific article; zbMATH DE number 7525484 (Why is no real title available?)
- Minimum k‐cores and the k‐core polytope
- In search of the densest subgraph
- Mathematical programming formulations for the collapsed k-core problem
- scientific article; zbMATH DE number 7525474 (Why is no real title available?)
- Independent sets in graphs
- Approximation for a scheduling problem with application in wireless networks
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- Knowledge cores in large formal contexts
- Designing optimally multiplexed SNP genotyping assays
- Equitable list tree-coloring of bounded treewidth graphs
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
- Efficient deterministic algorithms for embedding graphs on books
- Locally defined independence systems on graphs
- Maximum scan statistics and channel assignment problems in homogeneous wireless networks
- A sequential coloring algorithm for finite sets
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors
- Computing the depth distribution of a set of boxes
- Sublinear time estimation of degree distribution moments: the arboricity connection
- Note on coloring of double disk graphs
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
- Parameterized leaf power recognition via embedding into graph products
- Bounds and algorithms for graph trusses
- Efficient enumeration of dominating sets for sparse graphs
- A note on direct methods for approximations of sparse Hessian matrices
- Exploring the kernelization borders for hitting cycles
- Proof-labeling schemes: broadcast, unicast and in between
- Efficient enumeration of dominating sets for sparse graphs
- Going far from degeneracy
- Graph kernels: a survey
- Consecutive colorings of graphs
- Density decompositions of networks
- Parameterized leaf power recognition via embedding into graph products
- Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs
- Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
- On Fault-Tolerant Low-Diameter Clusters in Graphs
- Scaling-up reasoning and advanced analytics on BigData
- The smallest hard-to-color graph for the SL algorithm
- scientific article; zbMATH DE number 1251573 (Why is no real title available?)
- Counting Subgraphs in Degenerate Graphs
- Why is maximum clique often easy in practice?
- Efficiently enumerating all maximal cliques with bit-parallelism
- Worst-case analysis of clique MIPs
- Software for estimating sparse Jacobian matrices
- Estimation of sparse hessian matrices and graph coloring problems
- \((p,k)\)-coloring problems in line graphs
- Exact algorithms for maximum clique: a computational study
- A constant factor approximation algorithm for the storage allocation problem
This page was built for publication: Smallest-last ordering and clustering and graph coloring algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765255)
