Given a graph G=(V, E) G=(V,E) and a subset of its vertices V′⊆ VV^′⊆V, the subgraph
induced by V′ V^′ in G is that with vertex set V′ V^′ and edge set E′ E^′ formed by …

Given a simple undirected graph G, its Grundy chromatic number Γ (G)(or Grundy number)
defines the worst-case behavior for the well-known and widely-used greedy first-fit coloring …

Abstract Let G=(V, E) be a graph with vertex set V and edge set E, and consider γ∈[0, 1) to
be a real constant. A γ-clique (or quasi-clique) is a subset V′⊆ V inducing a subgraph of G …

One of the most actively researched areas in the field of process mining is process
discovery, which aims to construct a schema that aligns with existing event trace sequences …

Given a graph G=(V, E), a connected Grundy coloring is a proper vertex coloring that can be
obtained by a first-fit heuristic on a connected vertex sequence. A first-fit coloring heuristic is …

Dado um grafo G, seu número de Grundy Γ (G) define o comportamento de pior caso para a
conhecida e amplamente utilizada heurística de coloração gulosa first-fit. Mais …