Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,406
Register allocation via coloring of chordal graphs
- IN APLAS
, 2005
"... We present a simple algorithm for register allocation which is competitive with the iterated register coalescing algorithm of George and Appel. We base our algorithm on the observation that 95 % of the methods in the Java 1.5 library have chordal interference graphs when compiled with the JoeQ comp ..."
Abstract
-
Cited by 21 (1 self)
- Add to MetaCart
We present a simple algorithm for register allocation which is competitive with the iterated register coalescing algorithm of George and Appel. We base our algorithm on the observation that 95 % of the methods in the Java 1.5 library have chordal interference graphs when compiled with the Joe
An Optimistic and Conservative Register Assignment Heuristic for Chordal Graphs
, 2007
"... This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC). Previous register assignment heuristics eliminate copy instructions via coalescing, in other words, merging nodes in t ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC). Previous register assignment heuristics eliminate copy instructions via coalescing, in other words, merging nodes
Topology Control in Wireless Ad Hoc and Sensor Networks
- ACM Computing Surveys
, 2005
"... Topology Control (TC) is one of the most important techniques used in wireless ad hoc and sensor networks to reduce energy consumption (which is essential to extend the network operational time) and radio interference (with a positive effect on the network traffic carrying capacity). The goal of thi ..."
Abstract
-
Cited by 304 (4 self)
- Add to MetaCart
of this technique is to control the topology of the graph representing the communication links between network nodes with the purpose of maintaining some global graph property (e.g., connectivity), while reducing energy consumption and/or interference that are strictly related to the nodes ’ transmitting range
Chordal Graphs and Their Clique Graphs
- IN WG ’95
, 1995
"... In the first part of this paper, a new structure for chordal graph is introduced, namely the clique graph. This structure is shown to be optimal with regard to the set of clique trees. The greedy aspect of the recognition algorithms of chordal graphs is studied. A new greedy algorithm that generali ..."
Abstract
-
Cited by 20 (7 self)
- Add to MetaCart
In the first part of this paper, a new structure for chordal graph is introduced, namely the clique graph. This structure is shown to be optimal with regard to the set of clique trees. The greedy aspect of the recognition algorithms of chordal graphs is studied. A new greedy algorithm
Dually Chordal Graphs
- SIAM J. DISCRETE MATH
, 1998
"... Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for characterizations of those graphs in terms of neighborhood and clique hypergraphs which have the Helly property and whose l ..."
Abstract
-
Cited by 35 (16 self)
- Add to MetaCart
line graph is chordal. These graphs are dual (in the sense of hypergraphs) to chordal graphs. By using the hypergraph approach in a systematical way new results are obtained, some of the old results are generalized, and some of the proofs are simplified.
Graph Searching on Chordal Graphs
, 1997
"... In the graph searching problem, initially a graph with all edges contaminated is presented. We would like to obtain a state of the graph in which all edges are simultaneously clear by a sequence of moves using searchers. The objective is to achieve the desired state by using the least number of sear ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
of its endpoints. In this paper, we present a uniform approach to solve the above two graph searching problems on several classes of chordal graphs. For edge searching problem, we give an O(mn 2 )-time algorithm on split graphs, an O(m + n)-time algorithm on interval graphs, and an O(mn k )-time
Chordal Graphs and Their Clique Graphs
, 2014
"... In this paper, we present a new structure for chordal graph. We have also given the algorithm for MCS (Maximal Cardinality Search) and lexicographic BFS (Breadth First Search) which is used in two linear time and space algorithm. Also we discuss how to build a clique tree of a chordal graph and the ..."
Abstract
- Add to MetaCart
In this paper, we present a new structure for chordal graph. We have also given the algorithm for MCS (Maximal Cardinality Search) and lexicographic BFS (Breadth First Search) which is used in two linear time and space algorithm. Also we discuss how to build a clique tree of a chordal graph
Distance Approximating Trees for Chordal and Dually Chordal Graphs
, 1999
"... In this paper we show that, for each chordal graph G, there is a tree T such that T is a spanning tree of the square G² of G and, for every two vertices, the distance between them in T is not larger than the distance in G plus 2. Moreover, we prove that, if G is a strongly chordal graph or even a ..."
Abstract
-
Cited by 32 (19 self)
- Add to MetaCart
In this paper we show that, for each chordal graph G, there is a tree T such that T is a spanning tree of the square G² of G and, for every two vertices, the distance between them in T is not larger than the distance in G plus 2. Moreover, we prove that, if G is a strongly chordal graph or even
Graph Colorings on Chordal Graphs
"... Since chordal graphs possess an excellent ("perfect") property on ordinary (vertex) coloring, it is interesting to see what would happen on different colorings. In this talk, we define two graph colorings (or labellings) on a simple graph G = (V; E). First, given positive integers m,n, an ..."
Abstract
- Add to MetaCart
Since chordal graphs possess an excellent ("perfect") property on ordinary (vertex) coloring, it is interesting to see what would happen on different colorings. In this talk, we define two graph colorings (or labellings) on a simple graph G = (V; E). First, given positive integers m
Results 1 - 10
of
1,406
