5100 search results - page 232 / 1020 » The Linear Complexity of a Graph |
109
Voted
EJC
2008
15 years 21 days ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
125
click to vote
FCT
2003
Springer
15 years 5 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
120
Voted
PVLDB
2010
14 years 11 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
133
Voted
SOFSEM
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
97
Voted
COMBINATORICS
2004
15 years 14 days ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...