Documentation about graphs

[sha...@gmail.com]

Hello, I'm doing a personal project that involves intensive work with graphs and trees data structures.
There will be a lot of reads (indexed) and adds of nodes. I don't expect many random updates or deletes.
Do you guys have any recommendation on related documentation? Books or sites about algorithms, storage, partitioning...
Thanks!

[Kai Hendry]

If it doesn't need to be interactive:
http://www.gnuplot.info/

[vi]

> http://www.gnuplot.info/

Oh, honey..

[Kai Hendry]

Actually reading the original email, I think I might have mis-understood
what you mean by graphs.

http://www.amazon.co.uk/Introduction-Algorithms-T-Cormen/dp/0262533057/
is typically the bible in Comp Sci courses.

[sha...@gmail.com]

Yeah, I mean graphs as in the data structure. Any other resource a bit more specific about it? from a programming perspective, not a pure mathematical one

--
--
Chat: http://hackerspace.sg/chat

---
You received this message because you are subscribed to the Google Groups "HackerspaceSG" group.
To unsubscribe from this group and stop receiving emails from it, send an email to hackerspaces...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

[Meng Weng Wong]

is this more the sort of thing you're looking for?

http://neo4j.com/

[sha...@gmail.com]

A graph database; I have seen it and can be useful at some point, yes, although I was more interested in what algorithms specific for graphs it implements, and under which situations it needs them. I'd like to know if the cases I want to implement need to detect graph cycles, if so, what's the best way to detect or avoid them, ways that I can transform a graph into something equivalent with less complexity...

I have found quite a lot of disparate reading material in different sites like segmentation fault or wikipedia but I still miss something like a whole book about the subject that puts the narrative together (maybe something like "the bible of graphs")

I'll be busy for some time with all the open browser tabs that I've open about it, thanks :)

[Meng Weng Wong]

The Internet has opinions about this…

http://math.stackexchange.com/questions/27480/what-are-good-books-to-learn-graph-theory

A basic intro should cover DAGs, spanning trees, Kruskal's algorithm, etc.

You want to go farther into Internet-scale applications, http://www.amazon.com/Linked-The-New-Science-Networks/dp/0738206679

[Roland Turner]

I'd suggest TAOCP chapter 7.4, except that it's not published yet.

The Wikipedia page and the pages that it links to are pretty solid, but if you want a textbook-style survey of the field then check the references at the bottom of that some page; a couple of undergrad-level texts are listed.

- Roland

[Lawrence Lau]

time v money ... I have access to a graph-based database (ontological search but can be repurposed). so you can either code your own (with attendant bug fixing) or license-in an existing software component and just treat it as a cost of doing business and save your time for more interesting tasks in life.

>  I'd like to know if the cases I want to implement need to detect graph cycles,

there's actually very straight-forward algorithms that I'd learnt at 3rd year CompSci to check for cycles (sorry need out-core cache refresh for actual name) ... if you are doing anything with distributed systems and potential race conditions then I lean towards yes. Otherwise depending on what traits you consider are "common" you can do a simple/multiple hash table with linear search which then depends on #unique nodes.