Results 1  10
of
310,538
(k, +)distancehereditary graphs
 IN 27 TH INTERNATIONAL WORKSHOP, GRAPH  THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG
, 2001
"... In this work we introduce, characterize, and provide algorithmic results for (k, +)–distancehereditary graphs, k ≥ 0. These graphs can be used to model interconnection networks with desirable connectivity properties; a network modeled as a (k, +)–distancehereditary graph can be characterized as fo ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distancehereditary graphs, k ≥ 0. These graphs can be used to model interconnection networks with desirable connectivity properties; a network modeled as a (k, +)–distancehereditary graph can be characterized
distancehereditary graphs *
, 1998
"... Distancehereditary graphs are graphs in which every two vertices have the same distance in every connected induced subgraph containing them. This paper studies distancehereditary graphs from an algorithmic viewpoint. In particular, we present lineartime algorithms for finding a minimum weighted c ..."
Abstract
 Add to MetaCart
connected dominating set and a minimum vertexweighted Steiner tree in a distancehereditary graph. Both problems are MYcomplete in general graphs. 0 1998 Elsevier Science B.V. All rights reserved.
CHARACTERIZATION OF EFFICIENTLY PARALLEL SOLVABLE PROBLEMS ON DISTANCEHEREDITARY GRAPHS ∗
"... Abstract. In this paper, we sketch common properties ofa class ofsocalled subgraph optimization problems that can be systematically solved on distancehereditary graphs. Based on the found properties, we then develop a general problemsolving paradigm that solves these problems efficiently in paral ..."
Abstract
 Add to MetaCart
Abstract. In this paper, we sketch common properties ofa class ofsocalled subgraph optimization problems that can be systematically solved on distancehereditary graphs. Based on the found properties, we then develop a general problemsolving paradigm that solves these problems efficiently
Graph Classes between Parity and DistanceHereditary Graphs
 In 1st Discrete Mathematics and Theoretical Computer Science (DMTCS'96), Combinatorics, Complexity, and Logic
, 1999
"... Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distancehereditary graphs, are NPcomplete or open for parity graphs. Moreover, the metric characterizations of these two graph classes suggest an ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distancehereditary graphs, are NPcomplete or open for parity graphs. Moreover, the metric characterizations of these two graph classes suggest
Equistable DistanceHereditary Graphs
"... A graph is called equistable when there is a nonnegative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We show that a necessary condition for a graph to be equistable is su#cient when the graph in question is distanceheredit ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A graph is called equistable when there is a nonnegative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We show that a necessary condition for a graph to be equistable is su#cient when the graph in question is distancehereditary
The Hamiltonian problem on distancehereditary graphs
, 2006
"... In this paper, we first present an O(n + m)time sequential algorithm to solve the Hamiltonian problem on a distancehereditary graph G, where n and m are the number of vertices and edges of G, respectively. This algorithm is faster than the previous best known algorithm for the problem which takes ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper, we first present an O(n + m)time sequential algorithm to solve the Hamiltonian problem on a distancehereditary graph G, where n and m are the number of vertices and edges of G, respectively. This algorithm is faster than the previous best known algorithm for the problem which takes
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Efficiently computing static single assignment form and the control dependence graph
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract

Cited by 997 (8 self)
 Add to MetaCart
assignment form and the control dependence graph have been proposed to represent data flow and control flow propertiee of programs. Each of these previously unrelated techniques lends efficiency and power to a useful class of program optimization. Although both of these structures are attractive
Interprocedural Slicing Using Dependence Graphs
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1990
"... ... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previou ..."
Abstract

Cited by 822 (85 self)
 Add to MetaCart
... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends
Results 1  10
of
310,538