Click here to Skip to main content
15,498,516 members
Home / Discussions / Algorithms
   

Algorithms

 
AnswerRe: Stamp circular trade Pin
Mircea Neacsu6-Dec-20 6:45
mvaMircea Neacsu6-Dec-20 6:45 
GeneralRe: Stamp circular trade Pin
Shir Gans6-Dec-20 8:51
MemberShir Gans6-Dec-20 8:51 
QuestionGiven an array x, get the array y from a data set of arrays which has the smallest distance to x Pin
Member 1499380315-Nov-20 18:17
MemberMember 1499380315-Nov-20 18:17 
QuestionCLOSED Pin
AlgoHelp14-Nov-20 0:31
MemberAlgoHelp14-Nov-20 0:31 
AnswerRe: How to determine if 2 labelled graphs are identical? Pin
Greg Utas14-Nov-20 2:48
mveGreg Utas14-Nov-20 2:48 
GeneralRe: How to determine if 2 labelled graphs are identical? Pin
Greg Utas14-Nov-20 4:04
mveGreg Utas14-Nov-20 4:04 
GeneralCLOSED Pin
AlgoHelp14-Nov-20 4:49
MemberAlgoHelp14-Nov-20 4:49 
GeneralRe: How to determine if 2 labelled graphs are identical? Pin
Greg Utas14-Nov-20 5:03
mveGreg Utas14-Nov-20 5:03 
Your first paragraph is correct. So is your second paragraph, but of course all combinations have to be tried before concluding that the graphs are not isomorphic.

Your example shows why the problem is difficult. You have to try all combinations, though optimizations certainly exist. Trivially, the number of vertices in both graphs has to be the same. And if you sort their vertices' degrees, the two sequences have to be the same. But like the 6-vertex graph demonstrated, that isn't enough. There are undoubtedly more optimizations, which is why the article that I linked to speculated that the problem is NP-incomplete (easier than NP-complete). But you'd have to search the net to find the details of those algorithms.
Robust Services Core | Software Techniques for Lemmings | Articles
The fox knows many things, but the hedgehog knows one big thing.

GeneralCLOSED Pin
AlgoHelp14-Nov-20 5:24
MemberAlgoHelp14-Nov-20 5:24 
GeneralRe: How to determine if 2 labelled graphs are identical? Pin
Greg Utas14-Nov-20 6:41
mveGreg Utas14-Nov-20 6:41 
GeneralRe: How to determine if 2 labelled graphs are identical? Pin
Greg Utas15-Nov-20 2:27
mveGreg Utas15-Nov-20 2:27 
QuestionLong Division / Assembly Language Style Pin
C-P-User-313-Oct-20 5:34
MemberC-P-User-313-Oct-20 5:34 
AnswerRe: Long Division / Assembly Language Style Pin
Richard Deeming13-Oct-20 5:53
mveRichard Deeming13-Oct-20 5:53 
GeneralRe: Long Division / Assembly Language Style Pin
harold aptroot13-Oct-20 6:31
Memberharold aptroot13-Oct-20 6:31 
AnswerRe: Long Division / Assembly Language Style Pin
trønderen13-Oct-20 7:25
Membertrønderen13-Oct-20 7:25 
GeneralRe: Long Division / Assembly Language Style Pin
Greg Utas13-Oct-20 13:04
mveGreg Utas13-Oct-20 13:04 
AnswerRe: Long Division / Assembly Language Style Pin
Gerry Schmitz13-Oct-20 9:33
mveGerry Schmitz13-Oct-20 9:33 
AnswerRe: Long Division / Assembly Language Style Pin
Patrice T6-Nov-20 16:46
mvePatrice T6-Nov-20 16:46 
QuestionFinding possible combinations for tetris-like cages Pin
vinaysingh8424-Sep-20 15:25
Membervinaysingh8424-Sep-20 15:25 
AnswerRe: Finding possible combinations for tetris-like cages Pin
Gerry Schmitz25-Sep-20 8:41
mveGerry Schmitz25-Sep-20 8:41 
AnswerRe: Finding possible combinations for tetris-like cages Pin
vinaysingh8429-Sep-20 14:15
Membervinaysingh8429-Sep-20 14:15 
QuestionCalculate time complexity step by step of given two program program Pin
Member 1151248623-Sep-20 1:22
MemberMember 1151248623-Sep-20 1:22 
AnswerRe: Calculate time complexity step by step of given two program program Pin
Richard MacCutchan23-Sep-20 4:34
mveRichard MacCutchan23-Sep-20 4:34 
AnswerRe: Calculate time complexity step by step of given two program program Pin
trønderen23-Sep-20 5:07
Membertrønderen23-Sep-20 5:07 
AnswerRe: Calculate time complexity step by step of given two program program Pin
Gerry Schmitz24-Sep-20 14:01
mveGerry Schmitz24-Sep-20 14:01 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.