mirror of
https://git.lyx.org/repos/lyx.git
synced 2024-11-29 21:05:12 +00:00
Fix invalid colors (generated by LyX 1.4.3)
git-svn-id: svn://svn.lyx.org/lyx/lyx-devel/trunk@15653 a592a061-630c-0410-9148-cb99ea01b6c8
This commit is contained in:
parent
9f4cc3c9f0
commit
551fe79880
@ -937,7 +937,7 @@ status collapsed
|
|||||||
A
|
A
|
||||||
\color red
|
\color red
|
||||||
tournament
|
tournament
|
||||||
\color default
|
\color inherit
|
||||||
is a
|
is a
|
||||||
\end_layout
|
\end_layout
|
||||||
|
|
||||||
@ -1172,7 +1172,7 @@ only<10->{the Approximation Problem}}
|
|||||||
A
|
A
|
||||||
\color red
|
\color red
|
||||||
graph
|
graph
|
||||||
\color default
|
\color inherit
|
||||||
|
|
||||||
\begin_inset Formula $G=(V,E)$
|
\begin_inset Formula $G=(V,E)$
|
||||||
\end_inset
|
\end_inset
|
||||||
@ -1180,7 +1180,7 @@ graph
|
|||||||
, a
|
, a
|
||||||
\color red
|
\color red
|
||||||
source
|
source
|
||||||
\color default
|
\color inherit
|
||||||
|
|
||||||
\begin_inset Formula $s\in V$
|
\begin_inset Formula $s\in V$
|
||||||
\end_inset
|
\end_inset
|
||||||
@ -1188,7 +1188,7 @@ source
|
|||||||
and a
|
and a
|
||||||
\color red
|
\color red
|
||||||
target
|
target
|
||||||
\color default
|
\color inherit
|
||||||
|
|
||||||
\begin_inset Formula $t\in V$
|
\begin_inset Formula $t\in V$
|
||||||
\end_inset
|
\end_inset
|
||||||
@ -1210,7 +1210,7 @@ status collapsed
|
|||||||
A
|
A
|
||||||
\color red
|
\color red
|
||||||
maximum distance
|
maximum distance
|
||||||
\color default
|
\color inherit
|
||||||
\InsetSpace ~
|
\InsetSpace ~
|
||||||
|
|
||||||
\begin_inset Formula $d$
|
\begin_inset Formula $d$
|
||||||
@ -1246,7 +1246,7 @@ status collapsed
|
|||||||
An
|
An
|
||||||
\color red
|
\color red
|
||||||
approximation ratio
|
approximation ratio
|
||||||
\color default
|
\color inherit
|
||||||
|
|
||||||
\begin_inset Formula $r>1$
|
\begin_inset Formula $r>1$
|
||||||
\end_inset
|
\end_inset
|
||||||
@ -3451,7 +3451,7 @@ Let
|
|||||||
\end_inset
|
\end_inset
|
||||||
|
|
||||||
|
|
||||||
\color default
|
\color inherit
|
||||||
contain all triples
|
contain all triples
|
||||||
\begin_inset Formula $(T,s,t)$
|
\begin_inset Formula $(T,s,t)$
|
||||||
\end_inset
|
\end_inset
|
||||||
@ -3572,7 +3572,7 @@ Let
|
|||||||
\end_inset
|
\end_inset
|
||||||
|
|
||||||
|
|
||||||
\color default
|
\color inherit
|
||||||
contain all tuples
|
contain all tuples
|
||||||
\begin_inset Formula $(T,s,t,d)$
|
\begin_inset Formula $(T,s,t,d)$
|
||||||
\end_inset
|
\end_inset
|
||||||
@ -5656,7 +5656,7 @@ approximation scheme for
|
|||||||
\end_inset
|
\end_inset
|
||||||
|
|
||||||
|
|
||||||
\color default
|
\color inherit
|
||||||
gets as input
|
gets as input
|
||||||
\end_layout
|
\end_layout
|
||||||
|
|
||||||
@ -5798,7 +5798,7 @@ status inlined
|
|||||||
Tournament
|
Tournament
|
||||||
\color red
|
\color red
|
||||||
reachability
|
reachability
|
||||||
\color default
|
\color inherit
|
||||||
is in
|
is in
|
||||||
\color red
|
\color red
|
||||||
|
|
||||||
@ -5806,7 +5806,7 @@ reachability
|
|||||||
\end_inset
|
\end_inset
|
||||||
|
|
||||||
|
|
||||||
\color default
|
\color inherit
|
||||||
.
|
.
|
||||||
|
|
||||||
\end_layout
|
\end_layout
|
||||||
@ -5815,11 +5815,11 @@ reachability
|
|||||||
There exists a
|
There exists a
|
||||||
\color red
|
\color red
|
||||||
logspace approximation scheme
|
logspace approximation scheme
|
||||||
\color default
|
\color inherit
|
||||||
for
|
for
|
||||||
\color red
|
\color red
|
||||||
approximating
|
approximating
|
||||||
\color default
|
\color inherit
|
||||||
shortest paths in tournaments.
|
shortest paths in tournaments.
|
||||||
\end_layout
|
\end_layout
|
||||||
|
|
||||||
@ -5827,7 +5827,7 @@ approximating
|
|||||||
Finding
|
Finding
|
||||||
\color red
|
\color red
|
||||||
shortest paths
|
shortest paths
|
||||||
\color default
|
\color inherit
|
||||||
in tournaments is
|
in tournaments is
|
||||||
\color red
|
\color red
|
||||||
|
|
||||||
@ -5835,7 +5835,7 @@ shortest paths
|
|||||||
\end_inset
|
\end_inset
|
||||||
|
|
||||||
-complete
|
-complete
|
||||||
\color default
|
\color inherit
|
||||||
.
|
.
|
||||||
\end_layout
|
\end_layout
|
||||||
|
|
||||||
@ -6122,7 +6122,7 @@ Definition of Independence Number of a Graph
|
|||||||
The
|
The
|
||||||
\color red
|
\color red
|
||||||
independence number
|
independence number
|
||||||
\color default
|
\color inherit
|
||||||
|
|
||||||
\begin_inset Formula $\alpha(G)$
|
\begin_inset Formula $\alpha(G)$
|
||||||
\end_inset
|
\end_inset
|
||||||
@ -6156,7 +6156,7 @@ For each\InsetSpace ~
|
|||||||
,
|
,
|
||||||
\color red
|
\color red
|
||||||
reachability
|
reachability
|
||||||
\color default
|
\color inherit
|
||||||
in graphs with independence number
|
in graphs with independence number
|
||||||
\newline
|
\newline
|
||||||
at most\InsetSpace ~
|
at most\InsetSpace ~
|
||||||
@ -6184,7 +6184,7 @@ For each\InsetSpace ~
|
|||||||
, there exists a
|
, there exists a
|
||||||
\color red
|
\color red
|
||||||
logspace approximation scheme
|
logspace approximation scheme
|
||||||
\color default
|
\color inherit
|
||||||
for approximating the shortest path in graphs with independence number
|
for approximating the shortest path in graphs with independence number
|
||||||
at most\InsetSpace ~
|
at most\InsetSpace ~
|
||||||
|
|
||||||
@ -6207,7 +6207,7 @@ For each\InsetSpace ~
|
|||||||
, finding the
|
, finding the
|
||||||
\color red
|
\color red
|
||||||
shortest path
|
shortest path
|
||||||
\color default
|
\color inherit
|
||||||
in graphs with independence number at most\InsetSpace ~
|
in graphs with independence number at most\InsetSpace ~
|
||||||
|
|
||||||
\begin_inset Formula $k$
|
\begin_inset Formula $k$
|
||||||
@ -6220,7 +6220,7 @@ shortest path
|
|||||||
\end_inset
|
\end_inset
|
||||||
|
|
||||||
-complete
|
-complete
|
||||||
\color default
|
\color inherit
|
||||||
.
|
.
|
||||||
\end_layout
|
\end_layout
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user