# Dominator (graph theory)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Graphs and Combinatorics
- 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

- 2008

Given a graph G, the dominator coloring problem seeks a proper coloring of G with the additional property that every vertex inâ€¦Â (More)

Is this relevant?

2007

2007

- 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)

Is this relevant?

2006

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)

Is this relevant?

2005

2005

- SODA
- 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)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- 2002

Models of larval dispersal rarely incorporate the behavior of larvae, yet many potential settlers of marine invertebrates andâ€¦Â (More)

Is this relevant?

1995

1995

- Intermediate Representations Workshop
- 1995

Data flow analysis based on an incremental approach may require that the dominator tree be correctly maintained at all timesâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- POPL
- 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)

Is this relevant?

1977

1977

- IEEE Transactions on Engineering Management
- 1977

In an earlier study of scientific instrument innovations, it was found that instrument users rather than instrument manufacturersâ€¦Â (More)

Is this relevant?

Highly Cited

1974

Highly Cited

1974

- J. ACM
- 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)

Is this relevant?