4201 search results - page 48 / 841 » Interaction graphs: Additives |
125
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
128
Voted
CSR
2008
Springer
15 years 5 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
159
Voted
AVI
2006
15 years 5 months ago
2006
Scientific measurements are often depicted as line graphs. Stateof-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundred...
109
Voted
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...
169
Voted
IMC
2009
ACM
15 years 10 months ago
2009
ACM
Understanding how users behave when they connect to social networking sites creates opportunities for better interface design, richer studies of social interactions, and improved ...