15,904,877 members
Home / Discussions / Algorithms

# Algorithms

 Stamp circular trade Shir Gans29-Nov-20 6:25 Shir Gans 29-Nov-20 6:25
 Re: Stamp circular trade Gerry Schmitz29-Nov-20 18:40 Gerry Schmitz 29-Nov-20 18:40
 Re: Stamp circular trade Mircea Neacsu6-Dec-20 5:45 Mircea Neacsu 6-Dec-20 5:45
 Re: Stamp circular trade Shir Gans6-Dec-20 7:51 Shir Gans 6-Dec-20 7:51
 Given an array x, get the array y from a data set of arrays which has the smallest distance to x Member 1499380315-Nov-20 17:17 Member 14993803 15-Nov-20 17:17
 CLOSED AlgoHelp13-Nov-20 23:31 AlgoHelp 13-Nov-20 23:31
 Re: How to determine if 2 labelled graphs are identical? Greg Utas14-Nov-20 1:48 Greg Utas 14-Nov-20 1:48
 Re: How to determine if 2 labelled graphs are identical? Greg Utas14-Nov-20 3:04 Greg Utas 14-Nov-20 3:04
 This "same name" talk is confusing. The general problem is that the two graphs have different names for their vertices, so you have to try all possible ways of mapping one graph onto the other. So even if there's there's a vertex A in G1 and a vertex A in G2, that doesn't mean that you don't have to compare A in G1 with B in G2, and so on. You'd only need to compare A to A if you're deliberately being told to test a specific mapping, ignoring all others, or when you're solving the general problem and evaluating each possible mapping in succession. The neighbours must be the same, not just the degrees. Your example, where all the vertices have the same degree, shows why the problem is difficult. If it's an undirected graph and all the degrees are n-1, then it's easy because both must be complete graphs. If not, then let's say we had a graph with 6 vertices, all of degree 2. How can you tell whether these are two disjoint graphs (two C3's) or a connected bipartite graph? You have to go beyond the vertices' degrees to do that. On the surface, it looks NP-complete because there are n! possible mappings, and n! is approximated by an exponential function. Robust Services Core | Software Techniques for Lemmings | ArticlesThe fox knows many things, but the hedgehog knows one big thing.
 CLOSED AlgoHelp14-Nov-20 3:49 AlgoHelp 14-Nov-20 3:49
 Re: How to determine if 2 labelled graphs are identical? Greg Utas14-Nov-20 4:03 Greg Utas 14-Nov-20 4:03
 CLOSED AlgoHelp14-Nov-20 4:24 AlgoHelp 14-Nov-20 4:24
 Re: How to determine if 2 labelled graphs are identical? Greg Utas14-Nov-20 5:41 Greg Utas 14-Nov-20 5:41
 Re: How to determine if 2 labelled graphs are identical? Greg Utas15-Nov-20 1:27 Greg Utas 15-Nov-20 1:27
 Long Division / Assembly Language Style C-P-User-313-Oct-20 4:34 C-P-User-3 13-Oct-20 4:34
 Re: Long Division / Assembly Language Style Richard Deeming13-Oct-20 4:53 Richard Deeming 13-Oct-20 4:53
 Re: Long Division / Assembly Language Style harold aptroot13-Oct-20 5:31 harold aptroot 13-Oct-20 5:31
 Re: Long Division / Assembly Language Style trønderen13-Oct-20 6:25 trønderen 13-Oct-20 6:25
 Re: Long Division / Assembly Language Style Greg Utas13-Oct-20 12:04 Greg Utas 13-Oct-20 12:04
 Re: Long Division / Assembly Language Style Gerry Schmitz13-Oct-20 8:33 Gerry Schmitz 13-Oct-20 8:33
 Re: Long Division / Assembly Language Style Patrice T6-Nov-20 15:46 Patrice T 6-Nov-20 15:46
 Finding possible combinations for tetris-like cages vinaysingh8424-Sep-20 14:25 vinaysingh84 24-Sep-20 14:25
 Re: Finding possible combinations for tetris-like cages Gerry Schmitz25-Sep-20 7:41 Gerry Schmitz 25-Sep-20 7:41
 Re: Finding possible combinations for tetris-like cages vinaysingh8429-Sep-20 13:15 vinaysingh84 29-Sep-20 13:15
 Calculate time complexity step by step of given two program program Member 1151248623-Sep-20 0:22 Member 11512486 23-Sep-20 0:22
 Re: Calculate time complexity step by step of given two program program Richard MacCutchan23-Sep-20 3:34 Richard MacCutchan 23-Sep-20 3:34
 Last Visit: 31-Dec-99 18:00     Last Update: 24-May-24 7:13 Refresh ᐊ Prev1...891011121314151617 Next ᐅ