Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options answers only user 61755

Questions about properties of and problems on graphs, discrete data structures that have the form of nodes connected by edges, that is networks.

3
votes
They are different because... : Graph Partitioning: Giving a graph $G=(V,E)$, it is possible to partition $G$ into smaller components with specific properties. e.g. the k-way graph partitioning is …
answered Dec 2 '16 by darioSka
12
votes
Recalling that a clique is a subset $C$ of vertices of an undirected graph such that the subgraph induced by $C$ is fully connected. That is, every two distinct vertices in $C$ are connected by a dis …
answered Dec 15 '16 by darioSka
37
votes
Recalling that a directed graph is a graph where the edges have an associated direction with them. Using a directed graph you can represent asymmetrical relationships between nodes, while in undirec …
answered Jan 2 '17 by darioSka