The following pages link to Jürgen Ebert (Q287186):
Displaying 25 items.
- I-serializability: generalized correctness for transaction-based environments (Q287187) (← links)
- Parallel algorithms for a class of graphs generated recursively (Q582922) (← links)
- (Q593686) (redirect page) (← links)
- The path matrix of a graph, its construction and its use in evaluating certain products (Q793752) (← links)
- Numerical experiences with graph coloring algorithms (Q1070239) (← links)
- Efficient implementation of a shifting algorithm (Q1070825) (← links)
- Computing Eulerian trails (Q1111387) (← links)
- A note on odd and even factors of undirected graphs (Q1151266) (← links)
- A sensitive transitive closure algorithm (Q1156488) (← links)
- (Q1167193) (redirect page) (← links)
- st-ordering the vertices of biconnected graphs (Q1167194) (← links)
- An efficient algorithm to recognize locally equivalent graphs (Q1181011) (← links)
- Proof of a conjecture of Heiko Harborth on polyominoes of squares (Q1182554) (← links)
- A matching algorithm for regular bipartite graphs (Q1186308) (← links)
- On connected cutfree domination in graphs (Q1200040) (← links)
- Searching and pebbling (Q1821562) (← links)
- (Q3326860) (← links)
- (Q3326861) (← links)
- (Q3902492) (← links)
- (Q3907088) (← links)
- (Q3930652) (← links)
- (Q4195961) (← links)
- (Q4284242) (← links)
- (Q4742531) (← links)
- (Q4750670) (← links)
