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

1943-2018
0204019432017

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?
2005
2005
We present a linear-time algorithm that given a flowgraph <i>G</i> = (<i>V,A,r</i>) and a tree <i>T</i>, checks whether <i>T</i… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Models of larval dispersal rarely incorporate the behavior of larvae, yet many potential settlers of marine invertebrates and… (More)
  • figure 1
  • figure 2
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?
1977
1977
In an earlier study of scientific instrument innovations, it was found that instrument users rather than instrument manufacturers… (More)
  • figure 1
  • table I
  • table II
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1974
Highly Cited
1974
It is established that if <italic>G</italic> is a reducible flow graph, then edge (<italic>n, m</italic>) is backward (a back… (More)
  • figure 1
  • figure 3
  • figure 5
Is this relevant?