5100 search results - page 14 / 1020 » The Linear Complexity of a Graph |
101
click to vote
SODA
1992
ACM
15 years 26 days ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
IPL
2010
14 years 10 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
108
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
126
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
ISAAC
2007
Springer
15 years 5 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...