Pages that link to "Item:Q3765255"
From MaRDI portal
The following pages link to Smallest-last ordering and clustering and graph coloring algorithms (Q3765255):
Displaying 28 items.
- Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
- Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna (Q391234) (← links)
- Note on coloring of double disk graphs (Q475816) (← links)
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213) (← links)
- Independent sets in graphs (Q501998) (← links)
- A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
- Location-oblivious distributed unit disk graph coloring (Q534767) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- Minimum degree orderings (Q848936) (← links)
- Approximation for a scheduling problem with application in wireless networks (Q989801) (← links)
- Maximum scan statistics and channel assignment problems in homogeneous wireless networks (Q1019740) (← links)
- Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
- Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
- Designing optimally multiplexed SNP genotyping assays (Q1775775) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Computing the depth distribution of a set of boxes (Q2049979) (← links)
- Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy (Q2072075) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Proof-labeling schemes: broadcast, unicast and in between (Q2672621) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
