{"action":"created","issue":{"url":"https://api.github.com/repos/jgrapht/jgrapht/issues/661","repository_url":"https://api.github.com/repos/jgrapht/jgrapht","labels_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/661/labels{/name}","comments_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/661/comments","events_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/661/events","html_url":"https://github.com/jgrapht/jgrapht/issues/661","id":353641789,"node_id":"MDU6SXNzdWUzNTM2NDE3ODk=","number":661,"title":"Minimal node separator of a graph","user":{"login":"aduttaUNF12","id":31738725,"node_id":"MDQ6VXNlcjMxNzM4NzI1","avatar_url":"https://avatars0.githubusercontent.com/u/31738725?v=4","gravatar_id":"","url":"https://api.github.com/users/aduttaUNF12","html_url":"https://github.com/aduttaUNF12","followers_url":"https://api.github.com/users/aduttaUNF12/followers","following_url":"https://api.github.com/users/aduttaUNF12/following{/other_user}","gists_url":"https://api.github.com/users/aduttaUNF12/gists{/gist_id}","starred_url":"https://api.github.com/users/aduttaUNF12/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/aduttaUNF12/subscriptions","organizations_url":"https://api.github.com/users/aduttaUNF12/orgs","repos_url":"https://api.github.com/users/aduttaUNF12/repos","events_url":"https://api.github.com/users/aduttaUNF12/events{/privacy}","received_events_url":"https://api.github.com/users/aduttaUNF12/received_events","type":"User","site_admin":false},"labels":[{"id":2845887,"node_id":"MDU6TGFiZWwyODQ1ODg3","url":"https://api.github.com/repos/jgrapht/jgrapht/labels/enhancement","name":"enhancement","color":"84b6eb","default":true},{"id":1085401010,"node_id":"MDU6TGFiZWwxMDg1NDAxMDEw","url":"https://api.github.com/repos/jgrapht/jgrapht/labels/gsoc","name":"gsoc","color":"c5def5","default":false}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":2,"created_at":"2018-08-24T04:36:01Z","updated_at":"2018-12-22T12:17:19Z","closed_at":null,"author_association":"NONE","body":"Do you have any function implemented which finds the minimal uv-node separators of any pair of {u,v} nodes in any given graph? I see that you have something similar for chordal graphs. But do you have anything specific for general graphs?"},"comment":{"url":"https://api.github.com/repos/jgrapht/jgrapht/issues/comments/449566133","html_url":"https://github.com/jgrapht/jgrapht/issues/661#issuecomment-449566133","issue_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/661","id":449566133,"node_id":"MDEyOklzc3VlQ29tbWVudDQ0OTU2NjEzMw==","user":{"login":"ksskreddy","id":22563532,"node_id":"MDQ6VXNlcjIyNTYzNTMy","avatar_url":"https://avatars2.githubusercontent.com/u/22563532?v=4","gravatar_id":"","url":"https://api.github.com/users/ksskreddy","html_url":"https://github.com/ksskreddy","followers_url":"https://api.github.com/users/ksskreddy/followers","following_url":"https://api.github.com/users/ksskreddy/following{/other_user}","gists_url":"https://api.github.com/users/ksskreddy/gists{/gist_id}","starred_url":"https://api.github.com/users/ksskreddy/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/ksskreddy/subscriptions","organizations_url":"https://api.github.com/users/ksskreddy/orgs","repos_url":"https://api.github.com/users/ksskreddy/repos","events_url":"https://api.github.com/users/ksskreddy/events{/privacy}","received_events_url":"https://api.github.com/users/ksskreddy/received_events","type":"User","site_admin":false},"created_at":"2018-12-22T12:17:19Z","updated_at":"2018-12-22T12:17:19Z","author_association":"NONE","body":"What do u mean by minimal u,v separator?\r\n\r\n1) Let u,v be two vertices of an undirected graph G=(V,E). A vertex set S⊆V is a u,v-separator if u and v belong to different connected components of G−S. If no proper subset of a u,v-separator S is a u,v-separator then S is a minimal u,v-separator\r\n\r\nIs this \r\n\r\n2) A separator with minimum size?\r\n"}}
{"actor":{"display_login":"ksskreddy"}}