Archives are refreshed every 30 minutes - for details, please visit the main index.
You can also download the archives in mbox format.

igraph-help (date)

[Thread Index][Top][All Lists]

Advanced

[Prev Period]

Last Modified: Thu Mar 31 2011 18:09:22 -0400 Messages in reverse chronological order

[Next Period]

---

• March 31, 2011
  • Re: [igraph] correlation between attributes in bipartite network, Simone Gabbriellini, 18:09
  • Re: [igraph] betweenness centrality for weighted graphs, Gábor Csárdi, 15:56
  • Re: [igraph] about input file for igraph_clusters( ), Gábor Csárdi, 14:17
  • Re: [igraph] documentation build fail at revision 2412, Gábor Csárdi, 14:14
  • Re: [igraph] Question about assortativity, Gábor Csárdi, 14:06
  • Re: [igraph] correlation between attributes in bipartite network, Gábor Csárdi, 13:53
  • Re: [igraph] about input file for igraph_clusters( ), Yi Cao, 10:16
  • Re: [igraph] about input file for igraph_clusters( ), Tamas Nepusz, 05:18
  • [igraph] documentation build fail at revision 2412, Minh Nguyen, 01:10
• March 30, 2011
  • Re: [igraph] about the igraph_clusters( ), Tamás Nepusz, 17:57
  • [igraph] about the igraph_clusters( ), Yi Cao, 17:48
  • [igraph] Question about assortativity, Marcel Salathé, 17:35
  • Re: [igraph] edge-rotation graph distance, Gábor Csárdi, 10:01
  • [igraph] edge-rotation graph distance, sergiu netotea, 08:54
• March 29, 2011
  • [igraph] about input file for igraph_clusters( ), Yi Cao, 18:35
  • [igraph] betweenness centrality for weighted graphs, T.O. Richardson, 17:09
  • Re: [igraph] correlation between attributes in bipartite network, Gábor Csárdi, 14:26
  • [igraph] correlation between attributes in bipartite network, Simone Gabbriellini, 06:19
• March 28, 2011
  • Re: [igraph] R igraph 0.6 crashing on assortativity.nominal, Gábor Csárdi, 22:55
  • Re: [igraph] Installing development versi on of igraph in R - conflicting types for ‘ig raphdnaupd_’, Marcel Salathé, 17:17
  • [igraph] R igraph 0.6 crashing on assortativity.nominal, Marcel Salathé, 17:04
  • Re: [igraph] Installing development version of igrap h in R - conflicting types for ‘igraphdnaupd_’, Gábor Csárdi, 15:01
  • Re: [igraph] Installing development versi on of igraph in R - conflicting types for ‘ig raphdnaupd_’, Marcel Salathé, 13:14
  • Re: [igraph] Installing development version of igrap h in R - conflicting types for ‘igraphdnaupd_’, Gábor Csárdi, 12:02
  • Re: [igraph] Installing development versi on of igraph in R - conflicting types for ‘ig raphdnaupd_’, Marcel Salathé, 10:22
• March 25, 2011
  • Re: [igraph] Installing development version of igrap h in R - conflicting types for ‘igraphdnaupd_’, Gábor Csárdi, 19:21
  • Re: [igraph] Installing development version of igraph in R - conflicting t ypes for ‘igraphdnaupd_’, Przemek Grabowicz, 19:02
  • Re: [igraph] Installing development version of igrap h in R - conflicting types for ‘igraphdnaupd_’, Gábor Csárdi, 13:48
  • Re: [igraph] add vertex attributes from a data.frame, Simone Gabbriellini, 13:44
  • [igraph] Installing development version of igra ph in R - conflicting types for ‘igraphdnaupd_’, Przemek Grabowicz, 11:23
• March 24, 2011
  • Re: [igraph] add vertex attributes from a data.frame, Gábor Csárdi, 16:27
  • [igraph] add vertex attributes from a data.frame, Simone Gabbriellini, 15:57
  • Re: [igraph] segmentation fault, Gábor Csárdi, 14:09
  • [igraph] segmentation fault, Yi Cao, 13:48
• March 23, 2011
  • Re: [igraph] Clusterability, Tamas Nepusz, 05:58
  • [igraph] Clusterability, Marco LO, 01:06
• March 22, 2011
  • Re: [igraph] select node with probability proportional to degree, Simone Gabbriellini, 05:09
  • Re: [igraph] igraph_read_graph_gml memory leak?, Mile Sikic, 02:15
• March 21, 2011
  • Re: [igraph] select node with probability proportional to degree, Tamás Nepusz, 18:46
  • [igraph] select node with probability proportional to degree, Simone Gabbriellini, 18:27
• March 20, 2011
  • Re: [igraph] igraph in R: graphml support disabled, Gábor Csárdi, 10:39
• March 19, 2011
  • Re: [igraph] igraph in R: graphml support disabled, Prithwiraj MUKHERJEE, 11:04
  • Re: [igraph] igraph in R: graphml support disabled, Gábor Csárdi, 10:37
  • Re: [igraph] igraph in R: graphml support disabled, Prithwiraj MUKHERJEE, 10:31
  • Re: [igraph] igraph in R: graphml support disabled, Gábor Csárdi, 10:19
  • [igraph] igraph in R: graphml support disabled, Prithwiraj MUKHERJEE, 10:17
• March 18, 2011
  • Re: [igraph] igraph_read_graph_gml memory leak?, Tamas Nepusz, 05:35
  • [igraph] igraph_read_graph_gml memory leak?, Mile Sikic, 04:52
• March 15, 2011
  • Re: [igraph] Extracting vertex coordinates after plot command, and using weights in fruchterman_reingold, Greg More, 11:09
  • Re: [igraph] Extracting vertex coordinates after plot command, and using weights in fruchterman_reingold, Tamás Nepusz, 10:52
  • Re: [igraph] Extracting vertex coordinates after plot command, and using weights in fruchterman_reingold, Greg More, 10:49
  • Re: [igraph] Extracting vertex coordinates after plot command, and using weights in fruchterman_reingold, Tamás Nepusz, 09:53
  • [igraph] Extracting vertex coordinates after plot command, and using weights in fruchterman_reingold, Greg More, 09:45
  • Re: [igraph] igraph_get_shortest_paths() question, Paul Melis, 04:56
• March 14, 2011
  • Re: [igraph] Ego-centric graphing using weighted edges, Rick Welykochy, 14:56
  • Re: [igraph] igraph_get_shortest_paths() question, Gábor Csárdi, 10:48
  • Re: [igraph] igraph_get_shortest_paths() question, Tamás Nepusz, 10:45
  • [igraph] igraph_get_shortest_paths() question, Paul Melis, 10:41
• March 13, 2011
  • Re: [igraph] Plotting a multigraph?, Gábor Csárdi, 23:53
  • Re: [igraph] Ego-centric graphing using weighted edges, Gábor Csárdi, 23:52
  • Re: [igraph] Deque of vectors, Gábor Csárdi, 23:49
  • [igraph] Plotting a multigraph?, Moses Boudourides, 13:37
  • [igraph] Ego-centric graphing using weighted edges, Rick Welykochy, 04:47
  • [igraph] Deque of vectors, Mile Sikic, 03:47
• March 11, 2011
  • Re: [igraph] Maximum Common Subgraph, Mark Galea, 21:57
  • Re: [igraph] Maximum Common Subgraph, Tamás Nepusz, 14:18
  • Re: [igraph] Maximum Common Subgraph, Mark Galea, 13:33
  • Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 10:58
  • Re: [igraph] Maximum Common Subgraph, Mark Galea, 10:43
  • Re: [igraph] Maximum Common Subgraph, Mark Galea, 10:16
  • Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 09:57
  • Re: [igraph] Maximum Common Subgraph, Mark Galea, 09:45
  • Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 09:22
  • Re: [igraph] Maximum Common Subgraph, Mark Galea, 08:02
  • Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 06:41
  • Re: [igraph] Maximum Common Subgraph, Mark Galea, 06:38
  • Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 06:05
  • Re: [igraph] Maximum Common Subgraph, Mark Galea, 05:57
  • Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 05:50
  • Re: [igraph] Maximum Common Subgraph, Mark Galea, 05:46
  • Re: [igraph] Maximum Common Subgraph, Horváth Árpád, 05:37
• March 10, 2011
  • [igraph] Maximum Common Subgraph, Mark Galea, 22:32
  • Re: [igraph] dendrogram: leaf names and vertice labels, Gábor Csárdi, 14:31
  • RE: [igraph] dendrogram: leaf names and vertice labels, Glazko, Galina V, 14:27
  • Re: [igraph] dendrogram: leaf names and vertice labels, Gábor Csárdi, 14:21
  • [igraph] dendrogram: leaf names and vertice labels, Glazko, Galina V, 09:47
  • Re: [igraph] author lists to network, Simone Gabbriellini, 04:28
  • Re: [igraph] author lists to network, Simone Gabbriellini, 04:26
• March 09, 2011
  • Re: [igraph] author lists to network, Alex D'Amour, 19:31
  • [igraph] author lists to network, Stuart Kininmonth, 19:10
  • [igraph] degree vs. neighbors degree in bipartite network, Simone Gabbriellini, 11:34
  • Re: [igraph] dendrograms from communities, Gábor Csárdi, 09:53
  • RE: [igraph] dendrograms from communities, Glazko, Galina V, 01:01
• March 08, 2011
  • Re: [igraph] dendrograms from communities, Gábor Csárdi, 15:56
  • [igraph] dendrograms from communities, Glazko, Galina V, 15:31
  • Re: [igraph] Tethered network graphs, Gábor Csárdi, 12:15
  • [igraph] Tethered network graphs, Chris Silvia, 12:05
  • Re: [igraph] Diameter vs. longest shortest paths, Claudia Muller-Birn, 10:22
  • Re: [igraph] Diameter vs. longest shortest paths, Tamas Nepusz, 05:12
  • [igraph] Diameter vs. longest shortest paths, Claudia Muller-Birn, 03:46
  • Re: [igraph] Destroying uninitialized graphs, Gábor Csárdi, 00:10
• March 07, 2011
  • Re: [igraph] Destroying uninitialized graphs, Matthew Walker, 18:30
  • Re: [igraph] Destroying uninitialized graphs, Matthew Walker, 11:05
  • Re: [igraph] Destroying uninitialized graphs, Gábor Csárdi, 10:34
  • Re: [igraph] Destroying uninitialized graphs, Tamas Nepusz, 10:32
  • [igraph] Destroying uninitialized graphs, Matthew Walker, 10:28
  • Re: [igraph] How to find node name(id), Tamas Nepusz, 04:39
• March 06, 2011
  • [igraph] How to find node name(id), shahab, 16:55
  • Re: [igraph] Calculating average shortest path, Claudia Muller-Birn, 04:15
• March 05, 2011
  • Re: [igraph] Calculating average shortest path, Gábor Csárdi, 19:27
  • [igraph] Calculating average shortest path, Claudia Muller-Birn, 17:53
  • Re: [igraph] Getting started in igraph in C, Gábor Csárdi, 11:21
  • Re: [igraph] How to find out whether a graph follows Guassian (normal) or power law distribution without looking at their shape?, Tamás Nepusz, 11:08
  • Re: [igraph] How to find out whether a graph follows Guassian (normal) or power law distribution without looking at their shape?, Simone Gabbriellini, 11:03
  • Re: [igraph] Getting started in igraph in C, Prithwiraj MUKHERJEE, 10:59
  • Re: [igraph] Getting started in igraph in C, Gábor Csárdi, 10:40
  • Re: [igraph] How to find out whether a graph follows Guassian (normal) or power law distribution without looking at their shape?, shahab, 10:35
  • [igraph] Getting started in igraph in C, Prithwiraj MUKHERJEE, 10:29
  • Re: [igraph] How to find out whether a graph follows Guassian (normal) or power law distribution without looking at their shape?, Tamás Nepusz, 09:40
  • Re: [igraph] How to find out whether a graph follows Guassian (normal) or power law distribution without looking at their shape?, Horváth Árpád, 00:16
• March 04, 2011
  • Re: [igraph] How to find out whether a graph follows Guassian (normal) or power law distribution without looking at their shape?, Gang Su, 14:43
  • [igraph] How to find out whether a graph follows Guassian (normal) or power law distribution without looking at their shape?, shahab, 11:49
  • Re: [igraph] Ouput of igraph functions, Gábor Csárdi, 09:48
  • [igraph] Ouput of igraph functions, Alex Upton, 09:44
• March 03, 2011
  • Re: [igraph] Inconsistency in measuring using iGraph GUI (tkigraph() ) and command line R - What did I miss?, Gábor Csárdi, 10:23
  • Re: [igraph] Inconsistency in measuring using iGraph GUI (tkigraph() ) and command line R - What did I miss?, Gábor Csárdi, 10:20
  • [igraph] Inconsistency in measuring using iGraph GUI (tkigraph() ) and command line R - What did I miss?, shahab, 10:15
  • Re: [igraph] Nightly builds missing f2c files, Tamas Nepusz, 07:58
  • [igraph] Nightly builds missing f2c files, Tony, 00:31
• March 02, 2011
  • Re: [igraph] copyright in file examples/simple/igraph_ring.c, Gábor Csárdi, 13:30
  • [igraph] copyright in file examples/simple/igraph_ring.c, Minh Nguyen, 13:22
  • Re: [igraph] igraph_get_all_shortest_paths memory problem, Guilherme Ferraz de Arruda, 09:32
  • Re: [igraph] igraph_get_all_shortest_paths memory problem, Tamas Nepusz, 09:31
  • Re: [igraph] igraph_get_all_shortest_paths memory problem, Guilherme Ferraz de Arruda, 09:23
  • Re: [igraph] trunk: failed to build HTML documentation, Gábor Csárdi, 07:17
  • Re: [igraph] trunk: failed to build HTML documentation, Minh Nguyen, 07:13
  • Re: [igraph] igraph_get_all_shortest_paths memory problem, Tamas Nepusz, 06:34
  • Re: [igraph] igraph_get_all_shortest_paths memory problem, Guilherme Ferraz de Arruda, 00:17
• March 01, 2011
  • Re: [igraph] igraph_get_all_shortest_paths memory problem, Guilherme Ferraz de Arruda, 23:10
  • Re: [igraph] igraph_get_all_shortest_paths memory problem, Guilherme Ferraz de Arruda, 21:35
  • Re: [igraph] igraph_get_all_shortest_paths memory problem, Gábor Csárdi, 21:06
  • [igraph] igraph_get_all_shortest_paths memory problem, Guilherme Ferraz de Arruda, 20:58
  • Re: [igraph] trunk: failed to build HTML documentation, Tamás Nepusz, 16:33
  • Re: [igraph] correlation node degree and size 2nd order neighborhood [Was: Re: clustering coefficients for bipartite networks], Simone Gabbriellini, 05:56

---

[Prev Period]

[Next Period]

---

Mail converted by MHonArc