5889 search results - page 149 / 1178 » Graph Layout Problems |
168
click to vote
ADC
2008
Springer
15 years 11 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
155
Voted
PVLDB
2010
15 years 3 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
131
click to vote
ICSM
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both ...
137
click to vote
IFL
1997
Springer
15 years 8 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
142
click to vote
AAAI
2008
15 years 7 months ago
2008
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...