Sciweavers

3778 search results - page 45 / 756
» Representing Web Graphs
Sort
View
WALCOM
2010
IEEE
351views Algorithms» more  WALCOM 2010»
14 years 8 months ago
Pathwidth and Searching in Parameterized Threshold Graphs
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shas...
GD
2009
Springer
15 years 2 months ago
WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations
Traditional network visualization tools inherently suffer from scalability problems, particularly when such tools are interactive and web-based. In this paper we introduce WiGis â...
Brynjar Gretarsson, Svetlin Bostandjiev, John O'Do...
COMBINATORICA
1999
89views more  COMBINATORICA 1999»
14 years 9 months ago
A Sublinear Bipartiteness Tester for Bounded Degree Graphs
We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite or far from being bipartite. Graphs are represented by incidence lists of bounded len...
Oded Goldreich, Dana Ron
JMLR
2006
103views more  JMLR 2006»
14 years 9 months ago
A Graphical Representation of Equivalence Classes of AMP Chain Graphs
This paper deals with chain graph models under alternative AMP interpretation. A new representative of an AMP Markov equivalence class, called the largest deflagged graph, is prop...
Alberto Roverato, Milan Studený
100
Voted
MP
2006
81views more  MP 2006»
14 years 9 months ago
Almost all webs are not rank-perfect
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...
Arnaud Pêcher, Annegret Wagler