Search

Your search keyword '"Greedy coloring"' showing total 1,388 results

Search Constraints

Start Over You searched for: Descriptor "Greedy coloring" Remove constraint Descriptor: "Greedy coloring"
1,388 results on '"Greedy coloring"'

Search Results

101. The complexity of minimum convex coloring

102. Conflict-Free Coloring of Points and Simple Regions in the Plane

103. Newi-Perfect Cycle Decompositions via Vertex Colorings of Graphs

104. Adjacent vertex distinguishing colorings by sum of sparse graphs

105. Acyclic and star coloring of P 4 -reducible and P 4 -sparse graphs

106. Note on Cyclically Interval Edge Colorings of Simple Cycles

107. On the Maximum Number of Dominating Classes in Graph Coloring

108. A new efficient RLF-like algorithm for the vertex coloring problem

109. On the complexity of the flow coloring problem

110. Inapproximability of the lid-chromatic number

111. Strong edge-coloring for jellyfish graphs

112. Edge-colorings avoiding fixed rainbow stars

113. A Relaxed Case on 1-2-3 Conjecture

114. Maximum Clique Conformance Measure for Graph Coloring Algorithms

115. Coloring signed graphs using DFS

116. ON HAMILTONIAN COLORINGS OF FUZZY GRAPHS

117. 2-distance colorings of some direct products of paths and cycles

118. Fragmented coloring of proper interval and split graphs

119. d-strong total colorings of graphs

120. Acyclic coloring of graphs without bichromatic long path

121. The Center Colorıng of a Graph

122. 均匀染色最近的一些进展

123. Patterns from nature: Distributed greedy colouring with simple messages and minimal graph knowledge

124. Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results

125. Coupon coloring of some special graphs

127. Improved Greedy Algorithms for Learning Graphical Models

128. Three-rainbow coloring of split graphs

129. OUTER SUM COLORING OF A GRAPH

130. The Hybrid ColorAnt-RT Algorithms and an Application to Register Allocation

131. First-Fit colorings of graphs with no cycles of a prescribed even length

132. Polynomial-time algorithms for minimum weighted colorings of (P5,P¯5)-free graphs and similar graph classes

133. An improved bound on 2-distance coloring plane graphs with girth 5

134. Coloring Triple Systems with Local Conditions

135. On characterizing radiok-coloring problem by path covering problem

136. Sum List Colorings of Wheels

137. On an interval (1, 1)-coloring of incidentors of interval colorable graphs

138. Optimal Backbone Coloring of Split Graphs with Matching Backbones

139. On coloring box graphs

140. The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones

141. Interval incidence graph coloring

142. Minimum sum coloring for large graphs with extraction and backward expansion search

143. Complexity of Grundy coloring and its variants

144. Network Box Counting Heuristics

145. Graph multi-coloring for a job scheduling application

146. Acyclic coloring of graphs with some girth restriction

147. Frame-Based Medium Access Control for 5G Wireless Networks

148. On Indicated Coloring of Graphs

149. Odd edge coloring of graphs

150. A New and Fast Evolutionary Algorithm for Strict Strong Graph Coloring Problem

Catalog

Books, media, physical & digital resources