• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 3,592
Next 10 →

An algorithm for drawing general undirected graphs

by Tomihisa Kamada, Satoru Kawai - 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 698 (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

Undirected Graphs

by Hemant Kowshik, P. R. Kumar
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Time Varying Undirected Graphs

by Shuheng Zhou, John Lafferty, Larry Wasserman
"... 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 43 (8 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

by Walid Belkhir , 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

by Walid Belkhir, Luigi Santocanale , 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

Edge Partitions in Undirected Graphs

by Günther Stiege , 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

by Mladen Kolar, Eric P. Xing
"... 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

Packing Cycles in Undirected Graphs

by Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
"... Given an undirected graph G with n nodes and m edges, we address the problem of finding a largest collection of edge-disjoint cycles in G. The problem, dubbed Cycle Packing, is very closely related to a few genome rearrangement problems in computational biology. In this paper, we study the complex ..."
Abstract - Cited by 14 (0 self) - Add to MetaCart
Given an undirected graph G with n nodes and m edges, we address the problem of finding a largest collection of edge-disjoint cycles in G. The problem, dubbed Cycle Packing, is very closely related to a few genome rearrangement problems in computational biology. In this paper, we study

Dependency Parsing with Undirected Graphs

by Carlos Gómez-rodríguez, Daniel Fernández-gonzález
"... 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

Undirected Graphs of Entanglement Two

by Walid Belkhir, Luigi Santocanale
"... 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
Next 10 →
Results 1 - 10 of 3,592
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University