Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
77,973
An algorithm for drawing general undirected graphs
- Information Processing Letters
, 1989
"... Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, data-flow graphs, Petri nets, and entit ..."
Abstract
-
Cited by 690 (2 self)
- Add to MetaCart
Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, data-flow graphs, Petri nets
Time Varying Undirected Graphs
"... Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using ℓ1 penalization methods. However, current methods assume that the data are independent and identically distributed. If the distribution, and hence the graph, evolv ..."
Abstract
-
Cited by 46 (7 self)
- Add to MetaCart
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using ℓ1 penalization methods. However, current methods assume that the data are independent and identically distributed. If the distribution, and hence the graph
Undirected Graphs of Entanglement 3
, 2009
"... Entanglement is a complexity measure of digraphs that origins in fixed-point logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of entanglement at most k. Only partial results are known so far: dig ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
: digraphs for k = 1, and undirected graphs for k = 2. In this paper we investigate the structure of undirected graphs for k = 3. Our main tool is the so-called Tutte’s decomposition of 2-connected graphs into cycles and 3-connected components into a tree-like fashion. We shall give necessary conditions
Undirected graphs of entanglement 2
, 2007
"... Abstract. Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the problem of deciding whether a graph has entanglement at ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
two distinct characterizations of undirected graphs of entanglement at most 2. With these characterizations at hand, we present a linear time algorithm to decide whether an undirected graph has this property. 1
The guessing number of undirected graphs
"... Riis [Electron. J. Combin., 14(1):R44, 2007] introduced a guessing game for graphs which is equivalent to finding protocols for network coding. In this paper we prove upper and lower bounds for the winning probability of the guessing game on undirected graphs. We find optimal bounds for perfect grap ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
Riis [Electron. J. Combin., 14(1):R44, 2007] introduced a guessing game for graphs which is equivalent to finding protocols for network coding. In this paper we prove upper and lower bounds for the winning probability of the guessing game on undirected graphs. We find optimal bounds for perfect
Edge Partitions in Undirected Graphs
, 1998
"... Partitions of the set of edges of an undirected graph are investigated in general. The set of vertices of attachment of a partition and the partition of the W-components of a set of vertices are defined. Their properties show a high degree of duality. An algorithm to find the W-components is present ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Partitions of the set of edges of an undirected graph are investigated in general. The set of vertices of attachment of a partition and the partition of the W-components of a set of vertices are defined. Their properties show a high degree of duality. An algorithm to find the W
On Time Varying Undirected Graphs
"... The time-varying multivariate Gaussian distribution and the undirected graph associated with it, as introduced in Zhou et al. (2008), provide a useful statistical framework for modeling complex dynamic networks. In many application domains, it is of high importance to estimate the graph structure of ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
The time-varying multivariate Gaussian distribution and the undirected graph associated with it, as introduced in Zhou et al. (2008), provide a useful statistical framework for modeling complex dynamic networks. In many application domains, it is of high importance to estimate the graph structure
Undirected Graphs of Entanglement Two
"... Entanglement is a complexity measure of finite directed graphs whose purpose is to quantify to what extent cycles are intertwined. It has been introduced in [3, 2] to analyze the variable hierarchy of the Propositional Modal µ-calculus [5]. A main achievement of [3] states that parity games whose un ..."
Abstract
- Add to MetaCart
faster algorithms. In this talk, reporting on [1], we shall provide structural characterizations of undirected graphs of entanglement at most 2. More precisely, we provide two equivalent characterizations: one by means of algebraic terms based on a gluing operation, another one by forbidden subgraphs
Dependency Parsing with Undirected Graphs
"... We introduce a new approach to transitionbased dependency parsing in which the parser does not directly construct a dependency structure, but rather an undirected graph, which is then converted into a directed dependency tree in a post-processing step. This alleviates error propagation, since undire ..."
Abstract
- Add to MetaCart
We introduce a new approach to transitionbased dependency parsing in which the parser does not directly construct a dependency structure, but rather an undirected graph, which is then converted into a directed dependency tree in a post-processing step. This alleviates error propagation, since
Results 1 - 10
of
77,973
