Pages that link to "Item:Q992507"
From MaRDI portal
The following pages link to An optimal maximal independent set algorithm for bounded-independence graphs (Q992507):
Displaying 27 items.
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- Distributed independent sets in interval and segment intersection graphs (Q831804) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- Distributed large independent sets in one round on bounded-independence graphs (Q1664165) (← links)
- Computing large independent sets in a single round (Q1699422) (← links)
- Dynamic networks of finite state machines (Q2292917) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs (Q2403797) (← links)
- Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs (Q2441507) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- A log-star distributed maximal independent set algorithm for growth-bounded graphs (Q2934330) (← links)
- (Q3070898) (← links)
- An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Feedback from nature (Q5176090) (← links)
- Maximal independent sets in multichannel radio networks (Q5176112) (← links)
- Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems (Q5207898) (← links)
- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs (Q5405918) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- Optimal nearest neighbor queries in sensor networks (Q5899559) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420) (← links)
- Distributed coloring and the local structure of unit-disk graphs (Q5925586) (← links)
- A priori optimization for the probabilistic maximum independent set problem (Q5958320) (← links)
- Targeted Branching for the Maximum Independent Set Problem (Q6159907) (← links)
