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)

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

2012

2012

- Mustapha Chellali, FrÃ©dÃ©ric Maffray
- 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

- Ralucca Gera
- 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

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

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)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Fedor V. Fomin, Dimitrios M. Thilikos
- SODA
- 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

- Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan
- SODA
- 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

- KENT D. DANIEL, David Hirshleifer, +11 authors Matt Spiegel
- 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

- Mrdjan Jankovic
- IEEE Trans. Automat. Contr.
- 2001

Motivated by control Lyapunov functions and Razumikhin theorems on stability of time delay systems, we introduce the concept ofâ€¦Â (More)

Is this relevant?

1995

1995

- Vugranam C. Sreedhar, Guang R. Gao, Yong-Fong Lee
- 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

- Hiralal Agrawal
- 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?