Dominator (graph theory)

Known as: Postdominance, Dominator, Lengauer-Tarjan algorithm 
In computer science, in control flow graphs, a node d dominates a node n if every path from the entry node to n must go through d. Notationally, this… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1940-2017
05010019402016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
A dominator coloring is a coloring of the vertices of a graph such that every vertex is either alone in its color class or… (More)
Is this relevant?
2008
2008
Given a graph G, the dominator coloring problem seeks a proper coloring of G with the additional property that every vertex in… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2007
2007
  • Ralucca Gera
  • Fourth International Conference on Information…
  • 2007
A graph has a dominator coloring if it has a proper coloring in which each vertex of the graph dominates every vertex of some… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2006
2006
Given a graph G, the dominator coloring problem seeks a proper coloring of G with the additional property that every vertex in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Graph minors theory, developed by Robertson & Seymour, provides a list of powerful theoretical results and tools. However, the… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper offers a model in which asset prices ref lect both covariance risk and misperceptions of firms’ prospects, and in… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Motivated by control Lyapunov functions and Razumikhin theorems on stability of time delay systems, we introduce the concept of… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1995
1995
Data flow analysis based on an incremental approach may require that the dominator tree be correctly maintained at all times… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1994
Highly Cited
1994
In this paper we present techniques to find subsets of nodes of a flowgraph that satisfy the following property: A test set that… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 6
Is this relevant?